Fast filter-and-refine algorithms for subsequence selection

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2002-January, Issue , 2002, Pages 243-254

  Ooi, Beng Chin ^a   Pang, Hwee Hwa ^b   Wang, Hao ^a   Wong, Limsoon ^b   Yu, Cui ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Lab for Information Technology   (Singapore)

Author keywords

Computer science; Database systems; Delay; DNA; Indexing; Information technology; Matched filters; Proteins; Query processing; Sequences

Indexed keywords

ALGORITHMS; BIOINFORMATICS; COMPUTER SCIENCE; DNA; DNA SEQUENCES; INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); INFORMATION TECHNOLOGY; MATCHED FILTERS; PROTEINS; QUERY LANGUAGES; QUERY PROCESSING; SEARCH ENGINES;

BITMAP INDEXING; DELAY; DNA SEQUENCE DATABASE; LARGE SEQUENCES; REFINEMENT STEP; SEQUENCE DATABASE; SEQUENCES; SUBSEQUENCE MATCHING;

DATABASE SYSTEMS;

EID: 33744498586     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2002.1029677     Document Type: Conference Paper

References (32)

1. R. Baeza-Yates, G.H. Gonnet, "A New Approach to Text Searching", Communications of the ACM, Vol. 35, No. 10, pp 74-82, October 1992.
2. A. Bairoch, P. Bucher, "PROSITE: Recent Development", Nucleic Acids Research, Vol. 22, No. 5, pp 3583-3589, 1994.
3. A. Bairoch, P. Bucher, K. Hofmann, "The PROSITE database, its status in 1997", Nucleic Acids Research, Vol. 25, No. 1, pp 217-221, January 1997.
4. N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, "The R∗-tree: An Efficient and Robust Access Method for Points and Rectangles", Proc. of the ACM SIGMOD Conf., pp 322-331, May 1990.
5. R.S. Boyer, J.S. Moore, "A Fast String Searching Algorithm", Communications of the ACM, Vol. 20, No. 10, pp 762-772, October 1977.
6. C. Faloutsos, M. Ranganathan, Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases", Proc. of the ACM SIGMOD Conf., pp 419-429, May 1994.
7. R.M. Karp, M.O. Rabin, "Efficient Randomized Pattern-Matching Algorithms", IBM Journal of Research and Development, Vol. 31, No. 2, pp 249-260, March 1987.
8. G. Kadare and A.-L. Haenni, "Virus-encoded RNA helicases", Journal of Virology, Vol. 71, No. 4, pp 2583-2590, April 1997.
9. D.E. Knuth, J.H. Morris, V.R. Pratt "Fast Pattern Matching in Strings", SIAM Journal on Computing, Vol. 6, No. 2, pp 323-350, June 1977.
10. G.M. Landau, U. Vishkin, "Efficient String Matching in the Presence of Errors", Proc. of the 26th IEEE Symp. on Foundations of Computer Science, pp 126-136, October 1985.
11. G.M. Landau, U. Vishkin, "Fast Parallel and Serial Approximate String Matching", Journal of Algorithms, Vol. 10, No. 2, pp 157-169, June 1989.
12. E.M. McCreight, "A Space-Economical Suffix Tree Construction Algorithm", Journal of the ACM, Vol. 23, No. 2, pp 262-272, April 1976.
13. P. O'Neil, D. Quass, "Improved Query Performance with Variant Indexes", Proc. of the ACM SIGMOD Conf., pp 38-49, 1997.
14. K. Osatomi, H. Sumiyoshi, "Complete Nucleotide Sequence of Dengue Type 3 Virus Genome RNA", Virology, Vol. 176, No. 2, pp 643-647, 1990.
15. D. Rinfret, P. O'Neil, E. O'Neil, "Bit-Sliced Index Arithmetic", Proc. of the ACM SIGMOD Conf., 2001.
16. P.H. Sellers, "The Theory and Computation of Evolutionary Distances: Pattern Recognition", Journal of Algorithms, Vol. 1, No. 4, pp 359-373, December 1980.
17. G.A. Stephen, String Searching Algorithms, Lecture Notes Series on Computing and Problems, World Scientific, 1994.
18. K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications, Prentice-Hall, Inc., pp 132, 1982.
19. E. Ukkonen, "Finding Approximate Patterns in Strings", Journal of Algorithms, Vol. 6, No. 1, pp 132-137, March 1985.
20. E. Ukkonen, D. Wood, "Approximate String Matching with Suffix Automata", Algorithmica, Vol. 10, No. 5, pp 353-364, November 1993.
21. E. Ukkonen, "On-line Construction of Suffix Trees", Algorithmica, Vol. 14, No. 3, pp 249-260, September 1995.
22. J.T.L. Wang, G.W. Chirn, T.G. Marr, B. Shapiro, D. Shasha, K. Zhang, "Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results", Proc. of the ACM SIGMOD Conf., pp 115-125, May 1994.
23. R.A. Wagner, M.J. Fischer, "The String-to-String Correction Problem", Journal of the ACM, Vol. 21, No. 1, pp 168-173, January 1974.
24. P. Weiner, "Linear Pattern Matching Algorithms", Proc. of the IEEE 14th Annual Symposium on Switching and Automata Theory, pp 1-11, 1973.
25. R. Weber and H. Schek and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces". Proc. 24th International Conference on Very Large Data Bases, pp 194-205, 1998.
26. M.-C. Wu, "Query optimization for selections using bitmaps", Proc. of the ACM SIGMOD Conf., pp 227-238, 1999.
27. S. Wu, U. Manber, "Fast Text Searching Allowing Errors", Communications of the ACM, Vol. 35, No. 10, pp 83-91, October 1992.
28. P. Zezula, F. Rabitti, P. Tiberio, "Dynamic Partitioning of Signature Files", ACM Trans. on Information Systems, Vol. 9, No. 4, pp 336-369, October 1991.
29. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J., "Basic Local Alignment Search Tool", Journal of Molecular Biology, Vol 215, pp 403-410, 1990.
30. Altschul, S.F., Madden, T.L., Schffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J., "Gapped BLAST and PSI-BLAST: A New Generation of Protein Database Search Programs", Nucleic Acids Research, Vol 25, pp 3389-3402, 1997.
31. Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL, "GenBank", Nucleic Acids Research, Vol 28, No. 1, pp 15-18, 2000.
32. http://www.ncbi.nlm.nih.gov/Genbank/index.html