GASSST: Global alignment short sequence search tool

Bioinformatics

Volumn 26, Issue 20, 2010, Pages 2534-2540

  Rizk, Guillaume ^a   Lavenier, Dominique ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; METHODOLOGY; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT;

ALGORITHMS; BASE SEQUENCE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 77957815609     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq485     Document Type: Article

References (16)

1. Burrows,M. and Wheeler,D. (1994) A block-sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation, Palo Alto, CA.
2. Campagna,D. et al. (2009) PASS: a program to align short sequences. Bioinformatics, 25, 967.
3. Ferragina,P. and Manzini,G. (2000) Opportunistic data structures with applications. In Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, CA, USA, pp. 390-398.
4. Homer,N. et al. (2009) Bfast: an alignment tool for large scale genome resequencing. PLoS ONE, 4, e7767.
5. Jiang,H. and Wong,W. (2008) SeqMap: mapping massive amount of oligonucleotides to the genome. Bioinformatics, 24, 2395.
6. Langmead,B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
7. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25,1754-1760.
8. Li,H. and Durbin,R. (2010) Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics, 26, 589.
9. Li,H. et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851.
10. Li,R. et al. (2008) SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713.
11. Li,R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
12. Needleman,S. and Wunsch,C. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
13. Ning,Z. et al. (2001) SSAHA: a fast search method for large DNA databases. Genome Res., 11, 1725.
14. Rumble,S. et al. (2009) SHRiMP: accurate mapping of short color-space reads. PLoS Comput. Biol., 5, e1000386.
15. Smith,T. and Waterman,M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
16. Wendi,W. et al. (2009) Short read DNA fragment anchoring algorithm. BMC Bioinformatics, 10 (Suppl. 1), S17.