Long read alignment based on maximal exact match seeds

Bioinformatics

Volumn 28, Issue 18, 2012, Pages

  Liu, Yongchao ^a   Schmidt, Bertil ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CHROMOSOME MAP; COMPUTER PROGRAM; DNA SEQUENCE; EVALUATION; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; METHODOLOGY; SEQUENCE ALIGNMENT;

ALGORITHMS; CHROMOSOME MAPPING; GENOME, HUMAN; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84866447703     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts414     Document Type: Article

References (28)

1. Altschul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Blom,J. et al. (2011) Exact and complete short read alignment to microbial genomes using Graphics Processing Unit programming. Bioinformatics, 27, 1351-1358.
3. Bray,N. et al. (2003) AVID: a global alignment program. Genome Res., 13, 97-102.
4. Burrows,M. and Wheeler,D.J. (1994) A block sorting lossless data compression algorithm. Technical Report 124 Digital Equipment Corporation, Palo Alto, CA, USA.
5. Choi,J.H. et al. (2005) GAME: a simple and efficient whole genome alignment method using maximal exact match filtering. Comput. Biol. Chem., 29, 244-253.
6. Delcher,A.L. et al. (1999) Alignment of whole genomes. Nucleic Acids Res., 27, 2369-2376.
7. Ferragina,P. and Manzini,G. (2005) Indexing compressed text. J. ACM, 52, 4.
8. Höhl,M. et al. (2002) Efficient multiple genome alignment. Bioinformatics, 18(Suppl. 1), S312-S320.
9. Homer,N. et al. (2009) BFAST: an alignment tool for large scale genome resequencing. PLoS One, 4, e7767.
10. Kielbasa,S.M. et al. (2011) Adaptive seeds tame genomic sequence comparison. Genome Res., 21, 487-493.
11. Lam,T.W. et al. (2008) Compressed indexing and local alignment of DNA. Bioinformatics, 24, 791-797.
12. Langmead,B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
13. Langmead,B. and Salzberg,S. (2012) Fast gapped-read alignment with Bowtie 2. Nature Methods, 9, 357-359.
14. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1755-1760.
15. Li,H. and Durbin,R. (2010) Fast and accurate long read alignment with Burrows-Wheeler transform. Bioinformatics, 26, 589-595.
16. Li,H. et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
17. Li,H. et al. (2009) The sequence alignment/map format and SAMtools. Bioinformatics, 25, 2078-2079.
18. Li,R. et al. (2008) SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713-714.
19. Li,R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
20. Liu,Y. et al. (2012) CUSHAW: a CUDAcompatible short read aligner to large genomes based on the Burrows-Wheeler transform. Bioinformatics, 28, 1830-1837.
21. Ma,B. et al. (2002) PatternHunter: faster and more sensitive homology search. Bioinformatics, 18, 440-445.
22. Needleman,S.B. and Wunsch,C.D. (1970)Ageneral method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
23. Ning,Z. et al. (2001) SSAHA: a fast search method for large DNA databases. Genome Res., 11, 1725-1729.
24. Rasmussen,K.R. et al. (2006) Efficient q-gram filters for finding all epsilon-matches over a given length. J. Comput. Biol., 13, 296-308.
25. Rizk,G. and Lavenier,D. (2010) GASSST: global alignment short sequence search tool. Bioinformatics, 26, 2534-2540.
26. Rognes,T. (2011) Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation. BMC Bioinformatics, 12, 221.
27. Rumble,S.M. et al. (2009) SHRiMP: accurate mapping of short color-space reads. PLoS Comput. Biol., 5, e1000386.
28. Smith,T.F. and Waterman,M.S. (1991) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.