Exact match search in sequence data using suffix trees

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 123-130

  Halachev, Mihail ^a   Shiri, Nematollaah ^a   Thamildurai, Anand ^a  

^a Civil and Environmental Engineering   (Canada)

Author keywords

Bioinformatics; Indexing; Sequence Databases; Suffix Trees

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PERFORMANCE; TREES (MATHEMATICS);

BIOINFORMATICS; SEQUENCE DATABASES; SUFFIX TREES;

INDEXING (OF INFORMATION);

EID: 33745784628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099579     Document Type: Conference Paper

References (21)

1. S.F. Altschul S.F., W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. In J. Mol. Biol., 215:403-10, 1990.
2. S. F. Altschul, T. L. Madden, A. A. Schaeer, J. Zhang, Z. Zhang, W. Miller, and D. J. Lipman. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. In Nucleic Acids Research, 25:3389-3402, 1997.
3. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. In Softw. Pract. Exp., 25(2):129-141, 1995.
4. A. Apostolico and R. Giancarlo. The Boyer-Moore-Galil string searching strategies revisited. In SIAM Journal on Computing 15(1):98-105, 1986.
5. R.S. Boyer and J.S. Moore. A fast string searching algorithm. In Communications of the ACM. 20:762-772, 1977.
6. Christian Charras and Thierry Lecroq. ESMAJ: Exact String Matching Algorithms, Animation in Java. http://wwwigm.univ-lv.frl~lecroq/string/index. html. Laboratoire d'Informatique de Rouen, Université de Rouen. Last accessed: April, 2005.
7. R. Giegerich, S. Kurtz, and J. Stoye. Efficient implementation of lazy suffix trees. In Softw. Pract. Exper. 2003; 33:1035-1049, 2003
8. R. Giegerich, S. Kurtz, and J. Stoye. Wotdeager Source code, http://bibiserv.techfak.uni-bielefeld.de/wotd/. Last accessed March, 2005.
9. D. Gusfield. Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, 1997.
10. R. Nigel Horspool. Practical Fast Searching in Strings. In Software - Practice and Experience, 10:501-506, 1980.
11. E. Hunt, M.P. Atkinson, and R.W. Irving. A Database Index to Large Biological Sequences. In VLDB J., 7(3):139-148, 2001.
12. R.W. Irving and L. Love. The Suffix Binary Search Tree and Suffix AVL Tree. In Journal of Discrete Algorithms, 1 (2003) 387-408, 2003.
13. D.E. Knuth, J.H. Morris (Jr), and V.R. Pratt. Fast pattern matching in strings. In SIAM Journal on Computing 6(1):323-350, 1977.
14. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22(5):935-948, 1993.
15. C. Meek, J. M. Patel, and S. Kassety. OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences. In Proc. of VLDB, 2003
16. E.M. McCreight. A Space-economical Suffix Tree Construction Algorithm. In Journal of the ACM, 23(2):262-272, 1976.
17. D. R. Morrison. PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. In Journal of the ACM, 15(4) pp514-534, 1968.
18. S. Tata, R.A. Hankins, and J. Patel. Practical Suffix Tree Construction. In Proc. of the 30th VLDB, 2004
19. E. Ukkonen. On-line construction of suffix-trees. In Algorithmica 14 (1995), 249-260, 1995.
20. P. Weiner. Linear Pattern Matching Algorithms. In Proc. 14th Annual Symposium on Switching and Automata Theory, 1973.
21. http://www.ncbi.nlm.nih.gov - the NCBI web site. Last accessed: April 2005.