Approximate string matching in DNA sequences

Proceedings - 8th International Conference on Database Systems for Advanced Applications, DASFAA 2003

Volumn , Issue , 2003, Pages 303-310

  Cheng, Lok Lam ^a   Cheung, D W ^a   Yiu, Siu Ming ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bioinformatics; Data structures; Databases; DNA; Genomics; Humans; Indexing; Pattern matching; Sequences; Tree data structures

Indexed keywords

BIOINFORMATICS; DATA STRUCTURES; DATABASE SYSTEMS; DNA; FORESTRY; INDEXING (OF INFORMATION); PATTERN MATCHING; TREES (MATHEMATICS);

APPROXIMATE STRING MATCHING; APPROXIMATE STRING MATCHING PROBLEM; AUXILIARY DATA STRUCTURES; EFFICIENT DATA STRUCTURES; GENOMICS; HUMANS; SEQUENCES; TREE DATA STRUCTURES;

DNA SEQUENCES;

EID: 25844529539     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASFAA.2003.1192395     Document Type: Conference Paper

References (28)

1. S. Altschul, W. M. W. Gish, E. W. Myers, and D. Lipman. A basic local alignment search tool. J. Mol. Biol., 215:403-410, 1990.
2. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
3. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proc. of the 7th annual ACM-SIAM symposium on Discrete algorithms, pages 383-391, 1996.
4. A. Crauser and P. Ferragina. A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica, 32(1):1-35, 2002.
5. P. Ferragina and R. Grossi. The string b-tree: a new data structure for string search in external memory and its applications. ACM, 46(2):236-280, 1999.
6. H. Gary and N. Prywes. Outline for a multi-list organized system. In Annual Meeting of the ACM, 1959. paper 41, ACM, New York.
7. D. Gusfield. Algorithms on Strings, Trees, and Sequenes: Computer Science and Computational Biology. Cambridge University Press, 1997.
8. E. Hunt, M. P. Atkinson, and R. W. Irving. A database index to large biological sequence. In Proc. VLDB Conference, 2001.
9. H. Jagadish, N. Koudas, and D. Srivastava. On effective multi-dimensional indexing for strings. In ACM SIGMOD Conference on Management of Data, pages 403-414, 2000.
10. D. Lipman and W. R. Pearson. Rapid and sensitive protein similarity searches. Science, 227:1435-1441, 1985.
11. U. Manber and G. Myers. Suffix arrays: A new method for on-line string string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
12. E. M. McCreight. A space-economic suffix tree construction algorithm. Journal of the A.C.M., 23(2):262-272, 1976.
13. G. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-317, 1991.
14. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
15. G. Navarro and R. Baeza-Yates. A practical q-gram index for text retrieval allowing errors. CLEI Electronic Journal, 1(2), 1998.
16. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1(1):205-239, 2000.
17. G. Navarro and R. Baeza-Yates. Improving an algorithm for approximate pattern matching. Algorithmica, 30(4):473-502, 2001.
18. G. Navarro, E. S. R. Baeza-Yates, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19-27, 2001.
19. G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio. Indexing text with approximate q-grams. In Proc. on CPM, number 1848, pages 350-363, 2000.
20. W. R. Pearson and D. J. Lipman. Improved tools fr biological sequence comparison. In Proc. Natl. Academy Science, volume 85, pages 2444-2448, 1988.
21. th Annual Symposium on CPM, number 1848, pages 335-349, 2000.
22. D. Sankoff and J. B. Kruskal. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.
23. E. Ukkonen. Finding approximate patterns in strings. J. Algo., 6:132-137, 1985.
24. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14:249-260, 1995.
25. P. Weiner. Linear pattern matching algorithms. In Proc. of the 14th IEEE Symp. on Switching and Automata Theory, pages 1-11, 1973.
26. H. E. Williams and J. Zobel. Indexing and retrieval for genomic databases. IEEE Transactions on Knowledge and Data Engineering, 14(1):63-78, 2002.
27. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool. In Proc. of USENIX Technical Conf, pages 153-162, 1992.
28. S. Wu and U. Manber. A fast text searching allowing errors. Commun. ACM, 35(10):83-91, 1992.