2011
DOI: 10.1093/bfgp/elr035
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph

Abstract: Since the completion of the cucumber and panda genome projects using Illumina sequencing in 2009, the global scientific community has had to pay much more attention to this new cost-effective approach to generate the draft sequence of large genomes. To allow new users to more easily understand the assembly algorithms and the optimum software packages for their projects, we make a detailed comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph, from how they mat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
161
0
6

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 216 publications
(168 citation statements)
references
References 49 publications
1
161
0
6
Order By: Relevance
“…Current assembling algorithms for NGS consist of two main types [66]: (i) Overlap-layout-consensus (OLC) methods; and (ii) Eulerian/ de Bruijn Graph (DBG) methods. Both types utilise a graph theory to represent NGS data, but OLC considers reads to be nodes, while DBG takes k-mer for a node.…”
Section: Platform-specific Biasesmentioning
confidence: 99%
“…Current assembling algorithms for NGS consist of two main types [66]: (i) Overlap-layout-consensus (OLC) methods; and (ii) Eulerian/ de Bruijn Graph (DBG) methods. Both types utilise a graph theory to represent NGS data, but OLC considers reads to be nodes, while DBG takes k-mer for a node.…”
Section: Platform-specific Biasesmentioning
confidence: 99%
“…This algorithm ensures that if two PCR amplimers share same genomic areas, only the collective area will be reported and redundant area will be removed. The same algorithm was used for genome sequence assembly (Li et al, 2012). For calculating the total coverage for each PCR marker type, all in silico PCR amplimers belonging to each marker type were processed collectively .The same procedure was conducted in calculating the total primer set (83 primers) coverage.…”
Section: In Silico Pcr Analysismentioning
confidence: 99%
“…Present-day assembling algorithms for NGS comprise two main groups (Li Z. et al, 2012): (i) Overlap-layout-consensus (OLC) methods; and (ii) Eulerian/de Bruijn Graph (DBG) methods. Both groups apply a graph theory to deal with NGS data, but in OLC notation reads are nodes, while in DBG notation a k-mer is a node.…”
Section: Mapping/aligning To a Reference Genome And/or Assemblymentioning
confidence: 99%