AlignGraph: Algorithm for secondary de novo genome assembly guided by closely related references

Bioinformatics

Volumn 30, Issue 12, 2014, Pages

  Bao, Ergude ^a   Jiang, Tao ^a   Girke, Thomas ^b  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARABIDOPSIS; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; GENETICS; GENOME; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; METHODOLOGY; SEQUENCE ALIGNMENT; STANDARD;

ALGORITHMS; ARABIDOPSIS; GENOME; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; REFERENCE STANDARDS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84902492066     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu291     Document Type: Article

References (39)

1. Boetzer, M. and Pirovano, W. (2012) Toward almost closed genomes with gapfiller. Genome Biol., 13, R56.
2. Boetzer, M. et al. (2011) Scaffolding pre-assembled contigs using sspace. Bioinformatics, 27, 578-579.
3. Chaisson, M.J. and Pevzner, P.A. (2008) Short read fragment assembly of bacterial genomes. Genome Res., 18, 324-330.
4. Chaisson, M.J. et al. (2009) De novo fragment assembly with short mate-paired reads: does the read length matter? Genome Res., 19, 336-346.
5. Dayarian, A. et al. (2010) Sopra: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics, 11, 345.
6. Dohm, J.C. et al. (2007) Sharcgs, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Res., 17, 1697-1706.
7. Gao, S. et al. (2011) Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J. Comput. Biol., 18, 1681-1691.
8. Gnerre, S. et al. (2009) Assisted assembly: how to improve a de novo genome assembly by using related species. Genome Biol., 10, R88.
9. 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.
10. Gritsenko, A.A. et al. (2012) Grass: a generic algorithm for scaffolding next-generation sequencing assemblies. Bioinformatics, 28, 1429-1437.
11. Hernandez, D. et al. (2008) De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer. Genome Res., 18, 802-809.
12. Hu, T.T. et al. (2011) The Arabidopsis lyrata genome sequence and the basis of rapid genome size change. Nat. Genet., 43, 476-481.
13. Jeck, W.R. et al. (2007) Extending assembly of short DNA sequences to handle error. Bioinformatics, 23, 2942-2944.
14. Kent, W. (2002) Blatthe blast-like alignment tool. Genome Res., 12, 656-664.
15. Kim, J. et al. (2013) Reference-assisted chromosome assembly. Proc. Natl Acad. Sci. USA, 110, 1785-1790.
16. Langmead, B. and Salzberg, S.L. (2012) Fast gapped-read alignment with bowtie 2. Nat. Methods, 9, 357-359.
17. Li, H. and Homer, N. (2010) A survey of sequence alignment algorithms for next-generation sequencing. Brief. Bioinform., 11, 473-483.
18. Li, R. et al. (2010) De novo assembly of human genomes with massively parallel short read sequencing. Genome Res., 20, 265-272.
19. Lin, Y. et al. (2011) Comparative studies of de novo assembly tools for next-generation sequencing technologies. Bioinformatics, 27, 2031-2037.
20. Luo, R. et al. (2012) Soapdenovo2: an empirically improved memory-efficient short-read de novo assembler. Gigascience, 1, 18.
21. Medvedev, P. et al. (2011) Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers. J. Comput. Biol., 18, 1625-1634.
22. Miller, J.R. et al. (2008) Aggressive assembly of pyrosequencing reads with mates. Bioinformatics, 24, 2818-2824.
23. Ossowski, S. et al. (2008) Sequencing of natural strains of Arabidopsis thaliana with short reads. Genome Res., 18, 2024-2033.
24. Peng, Y. et al. (2010) Idba- A practical iterative de bruijn graph de novo assembler. In: Research in Computational Molecular Biology. Springer, Berlin Heidelberg, pp. 426-440.
25. Pevzner, P. et al. (2001) An eulerian path approach to dna fragment assembly. Proc. Natl Acad. Sci. USA, 98, 9748.
26. Phillippy, A.M. et al. (2008) Genome assembly forensics: finding the elusive mis-assembly. Genome Biol., 9, R55.
27. Pop, M. et al. (2004a) Comparative genome assembly. Brief. Bioinform., 5, 237-248.
28. Pop, M. et al. (2004b) Hierarchical scaffolding with bambus. Genome Res., 14, 149-159.
29. Ronen, R. et al. (2012) Sequel: improving the accuracy of genome assemblies. Bioinformatics, 28, i188-i196.
30. Salmela, L. et al. (2011) Fast scaffolding with small independent mixed integer programs. Bioinformatics, 27, 3259-3265.
31. Salzberg, S.L. et al. (2012) Gage: a critical evaluation of genome assemblies and assembly algorithms. Genome Res., 22, 557-567.
32. Schatz, M.C. et al. (2013) Hawkeye and AMOS: visualizing and assessing the quality of genome assemblies. Brief. Bioinform., 14, 213-224.
33. Schneeberger, K. et al. (2011) Reference-guided assembly of four diverse Arabidopsis thaliana genomes. Proc. Natl Acad. Sci. USA, 108, 10249-10254.
34. Simpson, J. et al. (2009) Abyss: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
35. Tsai, I.J. et al. (2010) Method improving draft assemblies by iterative mapping and assembly of short reads to eliminate gaps. Genome Biol., 11, R41.
36. Warren, R.L. et al. (2007) Assembling millions of short DNA sequences using ssake. Bioinformatics, 23, 500-501.
37. Zeitouni, B. et al. (2010) SVDetect: a tool to identify genomic structural variations from paired-end and mate-pair sequencing data. Bioinformatics, 26, 1895-1896.
38. Zerbino, D. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res., 18, 821-829.
39. Zimin, A.V. et al. (2013) The masurca genome assembler. Bioinformatics, 29, 2669-2677.