Efficient de novo assembly of large genomes using compressed data structures

Genome Research

Volumn 22, Issue 3, 2012, Pages 549-556

  Simpson, Jared T ^a   Durbin, Richard ^a  

^a WELLCOME TRUST SANGER INSTITUTE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; ARTICLE; COMPRESSED DATA STRUCTURE; DATA ANALYSIS; GENE SEQUENCE; GENETIC ALGORITHM; GENOME SEQUENCE ASSEMBLY; HUMAN GENOME; INFORMATION PROCESSING; MODEL; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; DATA COMPRESSION; GENOMICS; HUMANS; INTERNET; REPRODUCIBILITY OF RESULTS; SEQUENCE ANALYSIS, DNA; SOFTWARE;

MAMMALIA;

EID: 84857838310     PISSN: 10889051     EISSN: 15495469     Source Type: Journal    
DOI: 10.1101/gr.126953.111     Document Type: Article

References (28)

1. Bauer MJ, Cox AJ, Rosone G. 2011. Lightweight BWT construction for very large string collections. In Proceedings of the twenty-second annual symposium, Combinatorial Pattern Matching, pp. 219-231. Springer- Verlag, Berlin, Heidelberg.
2. Bentley DR, Balasubramanian S, Swerdlow HP, Smith GP, Milton J, Brown CG, Hall KP, Evers DJ, Barnes CL, Bignell HR, et al. 2008. Accurate whole human genome sequencing using reversible terminator chemistry. Nature 456: 53-59.
3. Boisvert S, Laviolette F, Corbeil J. 2010. Ray: simultaneous assembly of reads from a mix of high-throughput sequencing technologies. J Comput Biol 17: 1519-1533.
4. Burrows M, Wheeler DJ. 1994. A block-sorting lossless data compression algorithm. Digital SRC Research Report. http://citeseerx.ist.psu.edu/ viewdoc/summary?doi=10.1.1.37.6774.
5. C. elegans Sequencing Consortium. 1998. Genome sequence of the nematode C. elegans: a platform for investigating biology. Science 282: 2012-2018.
6. Chaisson MJ, Pevzner PA. 2008. Short read fragment assembly of bacterial genomes. Genome Res 18: 324-330. (Pubitemid 351240742)
7. Conway TC, Bromage AJ. 2011. Succinct data structures for assembling large genomes. Bioinformatics 27: 479-486.
8. Depristo MA, Banks E, Poplin R, Garimella KV, Maguire JR, Hartl C, Philippakis AA, Del Angel G, Rivas MA, Hanna M, et al. 2011. A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nat Genet 43: 491-498.
9. Earl D, Bradnam K, St John J, Darling A, Lin D, Fass J, Yu HO, Buffalo V, Zerbino DR, Diekhans M, et al. 2011. Genome Res 21: 2224-2241.
10. Ferragina P, Manzini G. 2000. Opportunistic data structures with applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 390-398. IEEE Computer Society, Washington, DC. http://dx.doi.org/10.1109/SFCS.2000.892127.
11. Ferragina P, Gagie T, Manzini G. 2010. Lightweight data indexing and compression in external memory. http://arxiv.org/abs/0909.4341.
12. Genome 10K Community of Scientists. 2009. Genome 10K: a proposal to obtain whole-genome sequence for 10,000 vertebrate species. J Hered 100: 659-674.
13. Gnerre S, Maccallum I, Przybylski D, Ribeiro FJ, Burton JN, Walker BJ, Sharpe T, Hall G, Shea TP, Sykes S, et al. 2011. High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc Natl Acad Sci 108: 1513-1518.
14. Ilie L, Fazayeli F, Ilie S. 2011. HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics 27: 295-302.
15. Kelley DR, Schatz MC, Salzberg SL. 2010. Quake: quality-aware detection and correction of sequencing errors. Genome Biol 11: R116. doi: 10.1186/ gb-2010-11-11-r116.
16. Korlach J, Bjornson KP, Chaudhuri BP, Cicero RL, Flusberg BA, Gray JJ, Holden D, Saxena R, Wegener J, Turner SW. 2010. Real-time DNA sequencing from single polymerase molecules. Methods Enzymol 472: 431-455.
17. Li H, Durbin R. 2009. Fast and accurate short read alignment with Burrows- Wheeler transform. Bioinformatics 25: 1754-1760.
18. Li H, Durbin R. 2010. Fast and accurate long-read alignment with Burrows- Wheeler transform. Bioinformatics 26: 589-595.
19. Li R, Fan W, Tian G, Zhu H, He L, Cai J, Huang Q, Cai Q, Li B, Bai Y, et al. 2010a. The sequence and de novo assembly of the giant panda genome. Nature 463: 311-317.
20. Li R, Zhu H, Ruan J, Qian W, Fang X, Shi Z, Li Y, Li S, Shan G, Kristiansen K, et al. 2010b. De novo assembly of human genomes with massively parallel short read sequencing. Genome Res 20: 265-272.
21. Myers EW. 2005. The fragment assembly string graph. Bioinformatics (Suppl 2) 21: ii79-ii85. (Pubitemid 41535433)
22. Pevzner PA, Tang H, Waterman MS. 2001. An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci 98: 9748-9753. (Pubitemid 32769375)
23. Pop M, Kosack DS, Salzberg SL. 2004. Hierarchical scaffolding with Bambus. Genome Res 14: 149-159. (Pubitemid 38088536)
24. Simpson JT, Durbin R. 2010. Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26: i367-i373.
25. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJ, Birol I. 2009. ABySS: a parallel assembler for short read sequence data. Genome Res 19: 1117-1123.
26. Sirén J. 2009. Compressed suffix arrays for massive data. In SPIRE '09, Proceedings of the 16th International Symposium on String Processing and Information Retrieval, pp. 63-74. Lecture Notes in Computer Science, Vol. 5721. Springer-Verlag, Berlin.
27. Stein LD. 2010. The case for cloud computing in genome informatics. Genome Biol 11: 207. doi: 10.1186/gb-2010-11-5-207.
28. Zerbino DR, Birney E. 2008. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res 18: 821-829. (Pubitemid 351645072)