SAGE: String-overlap Assembly of GEnomes

BMC Bioinformatics

Volumn 15, Issue 1, 2014, Pages

  Ilie, Lucian ^a   Haider, Bahlul ^a   Molnar, Michael ^a   Solis Oba, Roberto ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

De novo genome assembly; DNA sequencing; String overlap graph

Indexed keywords

DNA SEQUENCING; GENOME ASSEMBLY; OVERLAP GRAPH;

ALGORITHM; ARTICLE; COMPUTER GRAPHICS; DNA SEQUENCE; GENOME SIZE; GENOMICS; HIGH THROUGHPUT SEQUENCING; METHODOLOGY;

ALGORITHMS; COMPUTER GRAPHICS; GENOME SIZE; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; SEQUENCE ANALYSIS, DNA;

EID: 84908105783     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-15-302     Document Type: Article

References (29)

1. Metzker ML. Sequencing technologies - the next generation. Nat Rev Genet 2010, 11(1):31-46. 10.1038/nrg2626, 19997069.
2. Haussler D, O'Brien SJ, Ryder OA, Barker FK, Clamp M, Crawford AJ, Hanner R, Hanotte O, Johnson WE, McGuire JA, Miller W, Murphy RW, Murphy WJ, Sheldon FH, Sinervo B, Venkatesh B, Wiley EO, Allendorf FW, Amato G, Baker CS, Bauer A, Beja-Pereira A, Bermingham E, Bernardi G, Bonvicino CR, Burke T, Cracraft J, Diekhans M, Edwards S, et al. Bermingham E Genome 10K: a proposal to obtain whole-genome sequence for 10,000 vertebrate species. J Hered 2009, 100(6):659-674. 2877544, 19892720, Bermingham E.
3. Siva N. 1000 Genomes project. Nat Biotech 2008, 26(3):256.
4. Turnbaugh PJ, Ley RE, Hamady M, Fraser-Liggett CM, Knight R, Gordon JI. The human microbiome project. Nature 2007, 449(7164):804-810. 10.1038/nature06244, 3709439, 17943116.
5. Nagarajan N, Pop M. Sequence assembly demystified. Nat Rev Genet 2013, 14(3):157-167. 10.1038/nrg3367, 23358380.
6. Dohm JC, Lottaz C, Borodina T, Himmelbauer H. SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Res 2007, 17(11):1697-1706. 10.1101/gr.6435207, 2045152, 17908823.
7. Zerbino DR, Birney E. Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res 2008, 18(5):821-829. 10.1101/gr.074492.107, 2336801, 18349386.
8. Butler J, MacCallum I, Kleber M, Shlyakhter IA, Belmonte MK, Lander ES, Nusbaum C, Jaffe DB. ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res 2008, 18(5):810-820. 10.1101/gr.7337908, 2336810, 18340039.
9. Simpson JT, Wong K, Jackman S D S, Jones SJ, Birol T. ABySS: a parallel assembler for short read sequence data. Genome Res 2009, 19(6):1117-1123. 10.1101/gr.089532.108, 2694472, 19251739.
10. Li R, Zhu H, Ruan J, Qian W, Fang X, Shi Z, Li Y, Li S, Shan G, Kristiansen K, Li S, Yang H, Wang J, Wang J. De novo assembly of human genomes with massively parallel short read sequencing. Genome Res 2010, 20:265-272. 10.1101/gr.097261.109, 2813482, 20019144.
11. Luo R, Liu B, Xie Y, Li Z, Huang W, Yuan J, He G, Chen Y, Pan Q, Liu Y, Tang J, Wu G, Zhang H, Shi Y, Liu Y, Yu C, Wang B, Lu Y, Han C, Cheung DW, Yiu S-M, Peng S, Xiaoqian Z, Liu G, Liao X, Li Y, Yang H, Wang J, Lam T-W, Wang J. SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. GigaScience 2012, 1(1):18. 10.1186/2047-217X-1-18, 3626529, 23587118.
12. Simpson JT, Durbin R. Efficient de novo assembly of large genomes using compressed data structures. Genome Res 2012, 22(3):549-556. 10.1101/gr.126953.111, 3290790, 22156294.
13. Li H. Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 2012, 28(14):1838-1844. 10.1093/bioinformatics/bts280, 3389770, 22569178.
14. Bankevich A, Nurk S, Antipov D, Gurevich AA, Dvorkin M, Kulikov AS, Lesin VM, Nikolenko SI, Pham S, Prjibelski AD, Pyshkin AV, Sirotkin AV, Vyahhi N, Tesler G, Alekseyev MA, Pevzner PA. SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J Comput Biol 2012, 19(5):455-477. 10.1089/cmb.2012.0021, 3342519, 22506599.
15. Zimin AV, Marçais G, Puiu D, Roberts M, Yorke JA, Salzberg S L, Yorke JA. The MaSuRCA genome assembler. Bioinformatics 2013, 29(21):2669-2677. 10.1093/bioinformatics/btt476, 23990416, Salzberg S L.
16. Earl D, Bradnam K, John JS, Darling A, Lin D, Fass J, Yu HOK, Buffalo V, Zerbino DR, Diekhans M, Nguyen N, Ariyaratne PN, Sung W-K, Ning Z, Haimel M, Simpson JT, Fonseca NA, Birol I, Docking TR, Ho IY, Rokhsar DS, Chikhi R, Lavenier D, Chapuis G, Naquin D, Maillet N, Schatz MC, Kelley DR, Phillippy AM, Koren S, et al. NguyenN Assemblathon 1: a competitive assessment of de novo short read assembly methods. Genome Res 2011, 21(12):2224-2241. 10.1101/gr.126599.111, 3227110, 21926179, NguyenN.
17. Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, Koren S, Treangen TJ, Schatz MC, Delcher AL, Roberts M, Marçais G, Pop M, Yorke JA. GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res 2012, 22(3):557-567. 10.1101/gr.131383.111, 3290791, 22147368.
18. Bradnam KR, Fass JN, Alexandrov A, Baranay P, Bechner M, Birol I, Boisvert S, Chapman JA, Chapuis G, Chikhi R, Chitsaz H, Chou W-C, Corbeil J, Fabbro CD, Docking TR, Durbin R, Earl D, Emrich S, Fedotov P, Fonseca NA, Ganapathy G, Gibbs RA, Gnerre S, Godzaridis E, Goldstein S, Haimel M, Hall G, Haussler D, Hiatt JB, Ho IY, et al. Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. GigaScience 2013, 2(1):1-31. 10.1186/2047-217X-2-1, 3626537, 23587291.
19. Myers EW. Toward simplifying and accurately formulating fragment assembly. J Comput Biol 1995, 2(2):275-290. 10.1089/cmb.1995.2.275, 7497129.
20. Myers EW. The fragment assembly string graph. Bioinformatics 2005, 21(suppl 2):79-85.
21. Idury RM, Waterman MS. A new algorithm for DNA sequence assembly. J Comput Biol 1995, 2(2):291-306. 10.1089/cmb.1995.2.291, 7497130.
22. Pevzner PA, Tang H, Waterman MS. An Eulerian path approach to dna fragment assembly. Proc Nat Acad Sci 2001, 98(17):9748-9753. 10.1073/pnas.171285098, 55524, 11504945.
23. Medvedev P, Georgiou K, Myers G, Brudno M. Computability of models for sequence assembly. Algorithms in Bioinformatics, Lecture Notes in Bioinformatics 4645 2007, 289-301. Springer.
24. Ilie L, Molnar M. RACER: Rapid and accurate correction of errors in reads. Bioinformatics 2013, 29(19):2490-2493. 10.1093/bioinformatics/btt407, 23853064.
25. Kececioglu JD. Exact and approximation algorithms for DNA sequence reconstruction. PhD thesis The University of Arizona; 1991.
26. Medvedev P, Brudno M. Maximum likelihood genome assembly. J Comput Biol 2009, 16(8):1101-1116. 10.1089/cmb.2009.0047, 3154397, 19645596.
27. Goldberg AV. An efficient implementation of a scaling minimum-cost flow algorithm. J Algorithms 1997, 22(1):1-29.
28. Magoc T, Pabinger S, Canzar S, Liu X, Su Q, Puiu D, Tallon LJ, Salzberg SL. Gage-b: an evaluation of genome assemblers for bacterial organisms. Bioinformatics 2013, 29(14):1718-1725. 10.1093/bioinformatics/btt273, 3702249, 23665771.
29. Gurevich A, Saveliev V, Vyahhi N, Tesler G. QUAST: quality assessment tool for genome assemblies. Bioinformatics 2013, 29(8):1072-1075. 10.1093/bioinformatics/btt086, 3624806, 23422339.