Methods for the detection and assembly of novel sequence in high-throughput sequencing data

Bioinformatics

Volumn 31, Issue 12, 2015, Pages 1904-1912

  Holtgrewe, Manuel ^a   Kuchenbecker, Leon ^a,b   Reinert, Knut ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; COMPUTER PROGRAM; DNA SEQUENCE; HIGH THROUGHPUT SEQUENCING; HUMAN; PROCEDURES; SEQUENCE ALIGNMENT;

COMPUTATIONAL BIOLOGY; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84931035034     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btv051     Document Type: Article

References (35)

1. Alkan, C. et al. (2011) Genome structural variation discovery and genotyping. Nat. Rev. Genet., 12, 363-376
2. Altschul, S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410
3. Anson, E.L. and Myers, E.W. (1997) ReAligner: a program for refining DNA sequence multi-Alignments. J. Comput. Biol., 4, 369-383
4. Bonizzoni, P. et al. (2003) The haplotyping problem: an overview of computational models and solutions. J. Comput. Sci. Technol., 18, 675-688
5. Chevreux, B. (2005) MIRA: An Automated Genome and EST Assembler. Ph.D. thesis, Ruprechts-Karls-University Heidelberg
6. Danecek, P. et al. (2011) The variant call format and VCFtools. Bioinformatics, 27, 2156-2158
7. de Koning, A.J. et al. (2011) Repetitive elements may comprise over two-thirds of the human genome. PLoS Genet., 7, 1002384
8. Dezso, B. et al. (2011) LEMON-An open source C++ graph template library. Electr. Notes Theor. Comput. Sci., 264, 23-45
9. Dilworth, R.P. (1950) A decomposition theorem for partially ordered sets. Ann. Math., 51, 161-166
10. Döring, A. et al. (2008) SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinf., 9, 11
11. Eriksson, N. et al. (2008) Viral population estimation using pyrosequencing. PLoS Comput. Biol., 4, 1000074
12. Hajirasouliha, I. et al. (2010) Detection and characterization of novel sequence insertions using paired-end next-generation sequencing. Bioinformatics, 26, 1277-1283
13. Huson, D.H. et al. (2002) The greedy path-merging algorithm for contig scaffolding. J. ACM (JACM), 49, 603-615
14. Iqbal, Z. et al. (2012) De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet., 44, 226-232
15. Kececioglu, J. and Ju, J. (2001) Separating repeats in DNA sequence assembly. In: Proceedings of the fifth annual international conference on Computational biology, pp. 176-183
16. Kidd, J.M. et al. (2008) Mapping and sequencing of structural variation from eight human genomes. Nature, 453, 56-64
17. Kidd, J.M. et al. (2010) Characterization of missing human genome sequences and copy-number polymorphic insertions. Nat. Methods, 7, 365-371
18. Kim, S. et al. (2013) Reprever: resolving low-copy duplicated sequences using template driven assembly. Nucleic Acids Res., 41, 128
19. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760
20. Li, H. et al. (2009) The sequence alignment/map format and SAMtools. Bioinformatics, 25, 2078-2079
21. Li, S. et al. (2013) SOAPindel: efficient identification of indels from short paired reads. Genome Res., 23, 195-200
22. Medvedev, P. et al. (2009) Computational methods for discovering structural variation with next-generation sequencing. Nat. Methods, 6, 13
23. Miller, J.R. et al. (2008) Aggressive assembly of pyrosequencing reads with mates. Bioinformatics, 24, 2818-2824
24. Myers, E.W. et al. (2000) A whole-genome assembly of Drosophila. Science, 287, 2196-2204
25. Parrish, N. et al. (2011) Assembly of non-unique insertion content using nextgeneration sequencing. BMC Bioinf., 12, 3
26. Rausch, T. et al. (2009) A consistency-based consensus algorithm for de novo and reference-guided sequence assembly of short reads. Bioinformatics, 25, 1118-1124
27. Rausch, T. et al. (2012) DELLY: structural variant discovery by integrated paired-end and split-read analysis. Bioinformatics, 28, 333
28. Rizk, G. et al. (2014) MindTheGap: integrated detection and assembly of short and long insertions. Bioinformatics., 30, 3451-3457
29. Simpson, J.T. and Durbin, R. (2012) Efficient de novo assembly of large genomes using compressed data structures. Genome Res., 22, 549-556
30. Simpson, J.T. et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123
31. Sudmant, P.H. et al. (2010) Diversity of human copy number variation and multicopy genes. Science, 330, 641-646
32. Tammi, M.T. et al. (2002) Separation of nearly identical repeats in shotgun assemblies using defined nucleotide positions, DNPs. Bioinformatics, 18, 379-388
33. Wang, J. et al. (2011) CREST maps somatic structural variation in cancer genomes with base-pair resolution. Nat. Methods, 8, 652-654
34. Weese, D. et al. (2012) RazerS 3: faster, fully sensitive read mapping. Bioinformatics, 28, 2592-2599
35. Zerbino, D.R. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res., 18, 821-829