GMcloser: Closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments

Bioinformatics

Volumn 31, Issue 23, 2015, Pages 3733-3741

  Kosugi, Shunichi ^a,b   Hirakawa, Hideki ^a   Tabata, Satoshi ^a  

^a KAZUSA DNA RESEARCH INSTITUTE   (Japan)

^b Institute of Physical and Chemical Research   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM; CONTIG MAPPING; DNA SEQUENCE; HIGH THROUGHPUT SEQUENCING; PROCEDURES; SEQUENCE ALIGNMENT; STATISTICAL MODEL;

CONTIG MAPPING; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; LIKELIHOOD FUNCTIONS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84950294154     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btv465     Document Type: Article

References (42)

1. Assefa, S. et al. (2009) ABACAS: algorithm-based automatic contiguation of assembled sequences. Bioinformatics, 25, 1968-1969.
2. Au, K.F. et al. (2012) Improving PacBio long read accuracy by short read alignment. PLoS One, 7, e46679.
3. Boetzer, M. et al. (2011) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics, 27, 578-579.
4. Boetzer, M. and Pirovano, W. (2012) Toward almost closed genomes with GapFiller. Genome Biol., 13, R-56.
5. Chin, C.S. et al. (2013) Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data. Nat. Methods, 10, 563-569.
6. Denisov, G. et al. (2008) Consensus generation and variant detection by Celera Assembler. Bioinformatics, 24, 1035-1040.
7. English, A.C. et al. (2012) Mind the gap: upgrading genomes with Pacific Biosciences RS long-read sequencing technology. PLoS One, 7, e47768.
8. Gao, S. et al. (2012) FinIS: improved in silico finishing using an exact quadratic programming formulation. Lect. Notes Comput. Sci., 7534, 314-325.
9. Gao, S. et al. (2011) Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J. Comput. Biol., 18, 1681-1691.
10. Gnerre, S. et al. (2011) High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc. Natl. Acad. Sci. USA, 108, 1513-1518.
11. Gordon, D. et al. (2001) Automated finishing with autofinish. Genome Res., 11, 614-625.
12. Gurevich, A. et al. (2013) QUAST: quality assessment tool for genome assemblies. Bioinformatics, 29, 1072-1075.
13. Hackl, T. et al. (2014) proovread: large-scale high-accuracy PacBio correction through iterative short read consensus. Bioinformatics, 30, 3004-3011.
14. Howison, M. et al. (2013) Toward a statistically explicit understanding of de novo sequence assembly. Bioinformatics, 29, 2959-2963.
15. Hu, X. et al. (2012) pIRS: Profile-based Illumina pair-end reads simulator. Bioinformatics, 28, 1533-1535.
16. Huang, X. et al. (2006) Application of a superword array in genome assembly. Nucleic Acids Res., 34, 201-205.
17. Koren, S. et al. (2012) Hybrid error correction and de novo assembly of singlemolecule sequencing reads. Nat. Biotechnol., 30, 693-700.
18. Kosugi, S. et al. (2013) Coval: improving alignment quality and variant calling accuracy for next-generation sequencing data. PLoS One, 8, e75402.
19. Kurtz, S. et al. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R-12.
20. Li, H. (2012) Exploring single-sample SNP and INDEL calling with wholegenome de novo assembly. Bioinformatics, 28, 1838-1844.
21. Li, R. et al. (2010a) The sequence and de novo assembly of the giant panda genome. Nature, 463, 311-317.
22. Li, R. et al. (2010b) De novo assembly of human genomes with massively parallel short read sequencing. Genome Res., 20, 265-272.
23. Lin, S.H. and Liao, Y.C. (2013) CISA: contig integrator for sequence assembly of bacterial genomes. PLoS One, 8, e60843.
24. Luo, R. et al. (2012) SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. Gigascience, 1, 18.
25. Lysholm, F. et al. (2011) An efficient simulator of 454 data using configurable statistical models. BMC Res. Notes, 4, 449.
26. Margulies, M. et al. (2005) Genome sequencing in microfabricated highdensity picolitre reactors. Nature, 437, 376-380.
27. Miller, J.R. et al. (2010) Assembly algorithms for next-generation sequencing data. Genomics, 95, 315-327.
28. Nijkamp, J. et al. (2010) Integrating genome assemblies with MAIA. Bioinformatics, 26, i433-439.
29. Noe, L. and Kucherov, G. (2005) YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Res., 33, W540-W543.
30. Ono, Y. et al. (2013) PBSIM: PacBio reads simulator-toward accurate genome assembly. Bioinformatics, 29, 119-121.
31. Peng, Y. et al. (2012) IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth. Bioinformatics, 28, 1420-1428.
32. Piro, V.C. et al. (2014) FGAP: an automated gap closing tool. BMC Res. Notes, 7, 371.
33. Ross, M.G. et al. (2013) Characterizing and measuring bias in sequence data. Genome Biol., 14, R-51.
34. Ross, M.G. et al. (2013) Characterizing and measuring bias in sequence data. Genome Biol., 14, R-51.
35. Salzberg, S.L. et al. (2012) GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res., 22, 557-567.
36. Sommer, D.D. et al. (2007) Minimus: a fast, lightweight genome assembler. BMC Bioinformatics, 8, 64.
37. Soto-Jimenez, L.M. et al. (2013) GARM: genome assembly, reconciliation and merging pipeline. Curr. Top. Med. Chem., 14, 418-424.
38. Soueidan, H. et al. (2013) Finishing bacterial genome assemblies with Mix. BMC Bioinformatics, 14, S-16.
39. Treangen, T.J. and Salzberg, S.L. (2012) Repetitive DNA and next-generation sequencing: computational challenges and solutions. Nat. Rev. Genet., 13, 36-46.
40. Tsai, I.J. et al. (2010) Improving draft assemblies by iterative mapping and assembly of short reads to eliminate gaps. Genome Biol., 11, R-41.
41. Vicedomini, R. et al. (2013) GAM-NGS: genomic assemblies merger for next generation sequencing. BMC Bioinformatics, 14, S-6.
42. Yao, G. et al. (2012) Graph accordance of next-generation sequence assemblies. Bioinformatics, 28, 13-16.