GapFiller: A de novo assembly approach to fill the gap within paired reads

BMC Bioinformatics

Volumn 13, Issue SUPPL 1, 2012, Pages

  Nadalin, Francesca ^a,b   Vezzi, Francesco ^c   Policriti, Alberto ^a,b  

^a UNIVERSITY OF UDINE   (Italy)

^b Institute of Applied Genomics IGA   (Italy)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DE NOVO ASSEMBLIES; HIERARCHICAL APPROACH; HIGHLY ACCURATE; KERNEL ALGORITHMS; NEXT-GENERATION SEQUENCING; OUTPUT SEQUENCES; PREPROCESSING TOOLS; SEED-AND-EXTEND;

BIOINFORMATICS;

EXPERIMENTS;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; CONTIG MAPPING; DNA SEQUENCE; GENETICS; GENOME; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; METHODOLOGY; RHODOBACTER SPHAEROIDES; STAPHYLOCOCCUS AUREUS;

ALGORITHMS; CONTIG MAPPING; GENOME; GENOME, HUMAN; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; RHODOBACTER SPHAEROIDES; SEQUENCE ANALYSIS, DNA; SOFTWARE; STAPHYLOCOCCUS AUREUS;

EID: 84871481892     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-13-S14-S8     Document Type: Article

References (30)

1. Miller JR, Koren S, Sutton G. Assembly algorithms for next-generation sequencing data. Genomics 2010, 95(6):315-327. 10.1016/j.ygeno.2010.03.001, 2874646, 20211242.
2. Nagarajan N, Pop M. Parametric complexity of sequence assembly: theory and applications to next generation sequencing. Journal of Computational Biology 2009, 16(7):897-908. 10.1089/cmb.2009.0005, 19580519.
3. Li R, Fan W, Zhu H, He L, Cai J, Huang Q, Cai Q, Li B, Bai Y, Zhang Z, Zhang Y, Wang W, Li J, Wei F, Li H, Jian M, Li J, Zhang Z, Nielsen R, Li D, Gu W, Yang Z, Xuan Z, Ryder OA, Chi-Ching Leung F, Zhou Y, Cao J, Sun X, Fu Y, Fang X, et al. The sequence and de novo assembly of the giant panda genome. Nature 2009, 463(7279):311-317.
4. 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, et al. De novo assembly of human genomes with massively parallel short read sequencing. Genome Research 2010, 20(2):265-72. 10.1101/gr.097261.109, 2813482, 20019144.
5. Assemblathon. http://assemblathon.org/
6. Paszkiewicz K, Studholme DJ. De novo assembly of short sequence reads. Briefings in bioinformatics 2010, 11(5):457-472. 10.1093/bib/bbq020, 20724458.
7. Earl DA, Bradnam K, St John J, Darling A, Lin D, Faas J, Yu HOK, Vince B, Zerbino DR, Diekhans M, Nguyen N, Nuwantha P, Sung AWK, Ning Z, Haimel M, Simpson JT, Fronseca NA, Birol I, Docking TR, Ho IY, Rokhsar DS, Chikhi R, Lavenier D, Chapuis G, Naquin D, Maillet N, Schatz MC, Kelly DR, Phillippy AM, Koren S, et al. Assemblathon 1: A competitive assessment of de novo short read assembly methods. Genome Research 2011, 21(12):2224-2241. 10.1101/gr.126599.111, 3227110, 21926179.
8. dnGASP. http://cnag.bsc.es/
9. Salzberg SL, Phillippy AM, Zimin AV, Puiu D, Magoc T, Koren S, Treangen T, Schatz MC, Delcher AL, Roberts M, Marcais G, Pop M, Yorke JA. GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Research 2011, 22:557-567. http://www.ncbi.nlm.nih.gov/pubmed/22147368., http://genome.cshlp.org/content/22/3/557
10. Alkan C, Sajjadian S, Eichler E. Limitations of next-generation genome sequence assembly. Nature methods 2010, 8:61-65. 3115693, 21102452.
11. Narzisi G, Mishra B. Comparing de novo genome assembly: the long and short of it. PLoS ONE 2011, 6(4):e19175. 10.1371/journal.pone.0019175, 3084767, 21559467.
12. Vezzi F, Narzisi G, Mishra B. Feature-by-Feature, evaluating de novo sequence assembly. PLoS ONE 2012, 7(2):e31002. 10.1371/journal.pone.0031002, 3272011, 22319599.
13. Nadalin F, Vezzi F, Policriti A. GapFiller: a preprocessing step for the de novo assembly problem [abstract]. Proceedings on the 8th annual meeting of the Bioinformatics Italian Society 2011, 13-14., http://www.bits2011.it/index.php?pg=show&id=19
14. Warren RL, Sutton GG, Jones SJM, Holt RA. Assembling millions of short DNA sequences using SSAKE. Bioinformatics 2007, 23(4):500-501. 10.1093/bioinformatics/btl629, 17158514.
15. Dohm JC, Lottaz C, Borodina T, Himmelbauer H. SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Research 2007, 17(11):1697-1706. 10.1101/gr.6435207, 2045152, 17908823.
16. Bryant DW, Wong WK, Mockler TC. QSRA: a quality-value guided de novo short read assembler. BMC Bioinformatics 2009, 10:69. 10.1186/1471-2105-10-69, 2653489, 19239711.
17. Schmidt B, Sinha R, Beresford-Smith B, Puglisi SJ. A fast hybrid short read fragment assembly algorithm. Bioinformatics (Oxford, England) 2009, 25(17):2279-80., http://www.ncbi.nlm.nih.gov/pubmed/19535537
18. Rodrigue S, Materna AC, Timberlake SC, Blackburn MC, Malmstrom RR, Alm EJ, Chisholm SW. Unlocking short read sequencing for metagenomics. PLoS ONE 2010, 5(7):e11840. 10.1371/journal.pone.0011840, 2911387, 20676378.
19. Magoč T, Salzberg SL. FLASH: fast length adjustment of short reads to improve genome assemblies. Bioinformatics (Oxford, England) 2011, 27(21):2957-2963., http://www.ncbi.nlm.nih.gov/pubmed/21903629
20. Vezzi F, Del Fabbro C, Tomescu AI, Policriti A. rNA: a fast and accurate short reads numerical aligner. Bioinformatics 2011, 28:123-124.
21. Karp R, Rabin M. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 1987, 31(2):249-260.
22. Policriti A, Tomescu AI, Vezzi F. A randomized Numerical Aligner (rNA). Journal of Computer and System Sciences http://dx.doi.org/10.1016/j.jcss.2011.12.007.
23. Kelley DR, Schatz MC, Salzberg SL. Quake: quality-aware detection and correction of sequencing errors. Genome biology 2010, 11(11):R116. 10.1186/gb-2010-11-11-r116, 3156955, 21114842.
24. Medvedev P, Scott E, Kakaradov B, Pevzner P. Error correction of high-throughput sequencing datasets with non-uniform coverage. Bioinformatics 2011, 27(13):i137-i141. 10.1093/bioinformatics/btr208, 3117386, 21685062.
25. Gnerre S, MacCallum I, Przybylski D, Ribeiro FJ, Burton JN, Walker BJ, Sharpe T, Hall G, Shea TP, Sykes S, Berlin AM, Aird D, Costello M, Daza R, Williams L, Nicol R, Gnirke A, Nusbaum C, Lander ES, Jaffe DB. High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proceedings of the National Academy of Sciences 2010, 108(4):1513-1518., http://www.pnas.org/cgi/doi/10.1073/pnas.1017351108
26. Marçais G, Kingsford C. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics (Oxford, England) 2011, 27(6):764-770., http://bioinformatics.oxfordjournals.org/cgi/content/abstract/btr011v1
27. NCBI. http://www.ncbi.nlm.nih.gov
28. GAGE. http://gage.cbcb.umd.edu
29. Smith TF, Waterman MS. Identification of common molecular subsequences. Journal of molecular biology 1981, 147:195-197. 10.1016/0022-2836(81)90087-5, 7265238.
30. de la Bastide M, McCombie WR. Assembling Genomic DNA Sequences with PHRAP. Current Protocols in Bioinformatics 2007, 17(11):11.4.1-11.4.15., http://www.currentprotocols.com/WileyCDA/CPUnit/refId-bi1104.html