CcTSA: A coverage-centric threaded sequence assembler

PLoS ONE

Volumn 7, Issue 6, 2012, Pages

  Ahn, Jung Ho ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DNA FRAGMENT;

ARTICLE; CAENORHABDITIS ELEGANS; COMPUTER MEMORY; COMPUTER PROGRAM; COMPUTER SYSTEM; ESCHERICHIA COLI; GENE SEQUENCE; HIGH THROUGHPUT SEQUENCING; INTERMETHOD COMPARISON; LEISHMANIA MAJOR; QUALITY CONTROL; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; GENOME; HUMANS; INTERNET; SEQUENCE ANALYSIS; SOFTWARE;

EID: 84862536050     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0039232     Document Type: Article

References (22)

1. Miller JR, Koren S, Sutton G, (2010) Assembly algorithms for next-generation sequencing data. Genomics. 95(6): 315-27.
2. Butler J, MacCallum I, Kleber M, Shlyakhter IA, Belmonte MK, et al. (2008) ALLPATHS: de novo assembly of whole-genome shotgun microreads. Genome Research. 18(5): 810-20.
3. Elaine RM, (2008) Next-Generation DNA Sequencing Methods. Annu. Rev. Genom. Human Genet. 9: 387-402. doi: 10.1146/annurev.genom.9.081307.164359.
4. Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, et al. (2011) GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Research. doi: 10.1101/gr.131383.111.
5. Smith TF, (1980) Identification of common molecular subsequences. J. Mol. Bio. 147(1): 195-197.
6. Daniel RZ, Birney E, (2008) Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Research. 18(5): 821-829.
7. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJ, et al. (2009) ABySS: A parallel assembler for short read sequence data. Genome Research. 19(6): 1117-1123. doi: 10.1101/gr.089532.108.
8. Li R, Zhu H, Ruan J, Qian W, Fang X, et al. (2009) De novo assembly of human genomes with massively parallel short read sequencing. Genome Research. 20(2): 265-72.
9. Jackson BG, Regennitter M, Yang X, Schnable PS, Aluru S, (2010) Parallel de novo assembly of large genomes from high-throughput short reads. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). doi: 10.1109/IPDPS.2010.5470397.
10. Wenyu Z, Jiajia C, Yang Y, Yifei T, Jing S, et al. (2011) A Practical Comparison of De Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies. PLoS ONE. 6(3): e17915. doi: 10.1371/journal.pone.0017915.
11. Hennessy JL, Patterson DA, (2011) Computer Architecture, 5th Edition: A Quantitative Approach. Morgan Kaufmann. 708 p.
12. Culler D, Singh JP, Gupta A, (1998) Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann. 1056 p.
13. Pevzner PA, Tang H, Waterman MS, (2001) An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. 98: 9748-9753.
14. Berger ED, Zorn BG, McKinley KS, (2002) Reconsidering custom memory allocation. ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications. doi: 10.1145/582419.582421.
15. Richter DC, Ott F, Auch AF, Schmid R, Huson DH, (2008) MetaSim-A Sequencing Simulator for Genomics and Metagenomics. PLoS ONE. doi: 10.1371/journal.pone.0003373.
16. Plantagora Template website. Available:http://www.plantagora.org/tools_downloads/read_simulation.html. Accessed 2012 Feb 1.
17. 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.
18. Gnerre S, Maccallum I, Przybylski D, Ribeiro FJ, Burton JN,et al. 2011. High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc Natl Acad Sci 108: 1513-1518.
19. Marteb B, Christiaan VH, Hans JJ, Derek B, Walter P, (2010) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics. 27(4): 578-579. doi: 10.1093/bioinformatics/btq683.
20. Zhang Z, Schwartz S, Wagner L, Miller W, (2000) A greedy algorithm for aligning DNA sequences. J Comput Biol. 7(1-2): 203-14.
21. Stephen FA, Warren G, Webb M, Eugene WM, David JL, (1990) Basic local alignment search tool. J. Mol. Bio. 215(3): 403-410. doi: 10.1006/jmbi.1990.9999.
22. Marçais G, Kingsford C, (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics. 27 (6): 764-770. doi: 10.1093/bioinformatics/btr011.