Name
Abstract | ||
|---|---|---|
With the increasing impact of genomics in life sciences, the inference of high quality, reliable, and complete genome sequences is becoming critical. Genome assembly remains a major bottleneck in bioin-formatics: indeed, high throughput sequencing apparatus yield millions of short sequencing reads that need to be merged based on their overlaps. Overlap graph based algorithms were used with the first generation of sequencers, while de Bruijn graph (DBG) based methods were preferred for the second generation. Because the sequencing coverage varies locally along the molecule, state-of-the-art assembly programs now follow an iterative process that requires the construction of de Bruijn graphs of distinct orders (i.e., sizes of the overlaps). The set of resulting sequences, termed unitigs, provide an important improvement compared to single DBG approaches. Here, we present a novel approach based on a digraph, the Superstring Graph, that captures all desired sizes of overlaps at once and allows to discard unreliable overlaps. With a simple algorithm, the Superstring Graph delivers sequences that includes all the unitigs obtained from multiple DBG as substrings. In linear time and space, it combines the efficiency of a greedy approach to the advantages of using a single graph. In summary, we present a first and formal comparison of the output of state-of-the-art genome assemblers. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-41168-2_4 | ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT |
Field | DocType | Volume |
Substring,Combinatorics,Computer science,Algorithm,Genomics,Greedy algorithm,De Bruijn graph,Suffix tree,De Bruijn sequence,Time complexity,Sequence assembly | Conference | 9778 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.34 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bastien Cazaux | 1 | 10 | 6.65 |
| Gustavo Sacomoto | 2 | 45 | 5.81 |
| E Rivals | 3 | 13 | 6.29 |