Compressed indexing and local alignment of DNA

Bioinformatics

Volumn 24, Issue 6, 2008, Pages 791-797

  Lam, T W ^a   Sung, W K ^b   Tam, S L ^a   Wong, C K ^a   Yiu, S M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

MESSENGER RNA;

ACCURACY; ARTICLE; CHICKEN; CHIMPANZEE; COMPUTER PROGRAM; CONTROLLED STUDY; DNA DETERMINATION; GENETIC DATABASE; HUMAN; HUMAN GENOME; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; NONHUMAN; PRIORITY JOURNAL; RANDOMIZATION; SEQUENCE ALIGNMENT; SIMULATION; ZEBRA FISH;

EID: 40749108125     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn032     Document Type: Article

References (24)

1. Altschul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Altschul,S.F. et al. (1997) Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucl. Acids Res., 25, 3389-3402.
3. Burkhardt,S. et al. (1999) q-Gram based database searching using a suffix array (quasar). RECOMB, 77-83.
4. Burrow,M. and Wheeler,D.J. (1994) A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, California.
5. Cao,X. et al. (2005) Indexing DNA sequences using q-grams. DASFAA, 4-16.
6. Ferragina,P. and Manzini,G. (2000) Opportunistic data structures with applications. FOCS, 390-398.
7. Ferragina,P. and Manzini,G. (2001) An experimental study of an opportunistic index. SODA, 269-278.
8. Giladi,E. et al. (2002) SST: An algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size. Bioinformatics, 18, 873-877.
9. Grossi,R. and Vitter,J.S. (2000) Compressed suffix arrays and suffix trees with applications to text indexing and string matching. STOC, 397-406.
10. Gusfield,D. (1997) Algorithms on Strings, Trees, and Sequences. Cambridge University Press.
11. Healy,J. et al. (2003) Annotating large genomes with exact word matches. Genomes Research, 13, 2306-2315.
12. Hon,W.K. et al. (2007) Constructing compressed suffix arrays with large alphabets. Algorithmica, 48, 23-36.
13. Hon,W.K. et al. (2004) Practical aspects of compressed suffix arrays and FM-Index in searching DNA sequences. ALENEX/ANALC, 31-38.
14. Hunt,E. et al. (2002) Database indexing for large DNA and protein sequence collections. The VLDB J., 11, 256-271.
15. Karlin,S. and Altschul,S.F (1990) Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proceedings of the National Academy of Sciences, 87 2264-2268.
16. Kurtz,S. (1999) Reducing the space requirement of suffix trees. Software Practice and Exp., 29, 1149-1171.
17. Li,M. et al. (2004) PatterHunter II: Highly sensitive and fast homology search. J. Bioinformatics Comput. Biol., 2, 417-440.
18. Lippert,R. (2005) Space-efficient whole genome comparisons with Burrows-Wheeler transforms. J. Comput. Biol., 12, 407-415.
19. McCreight,E.M. (1976) A space-economical suffix tree construction algorithm. J. ACM, 23, 262-272.
20. Meek,C. et al. (2003) OASIS: An online and accurate technique for local-alignment searches on biological sequences. VLDB, 910-921.
21. Ozturk,O. and Ferhatosmanoglu,H. (2003) Effective indexing and filtering for similarity search in large biosequence databases. BIBE, 359-366.
22. Sadakane,K. (2003) New text indexing functionalities of the compressed suffix arrays. J. Algorithms, 48, 294-313.
23. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
24. Williams,H.E. and Zobel,J. (2002) Indexing and retrieval for genomic databases. IEEE Trans. Knowledge Data Eng., 14, 63-78.