Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results

ACM SIGMOD Record

Volumn 23, Issue 2, 1994, Pages 115-125

  Wang, Jason Tsong Li ^a   Chirn, Gung Wei ^a   Marr, Thomas G ^b   Shapiro, Bruce ^c   Shasha, Dennis ^d   Zhang, Kaizhong ^e  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b Simons Center for Quantitative Biology   (United States)

^c NATIONAL CANCER INSTITUTE   (United States)

^d NEW YORK UNIVERSITY   (United States)

^e UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MICROORGANISMS; PROTEINS;

PATTERN DISCOVERY; SCIENTIFIC DATA;

DATABASE SYSTEMS;

EID: 0028449142     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/191843.191863     Document Type: Article

References (42)

1. R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, and A. Swami. An interval classifier for database mining applications. In Proceedings of the 18th International Conference on Very Large Data Bases, pages 560-573, Vancouver, Canada, Aug. 1992.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., May 1993.
3. D. J. Bacon and W. J. Anderson. Multiple sequence alignment. Journal of Molecular Biology, 191:153-161, 1986.
4. A. Bairoch. PROSITE: A dictionary of sites and patterns in proteins. Nucleic Acids Research, 20:2013-2018, 1992.
5. A. Bairoch and B. Boeckmann. The SWISS-PROT protein sequence data bank. Nucleic Acids Research, 20:2019-2022, 1992.
6. W. Buntine and M. D. Alto, editors. Collected Notes on the Workshop for Pattern Discovery in Large Databases. Technical Report FIA-9107, NASA Ames Research Center, Moffett Field, California, April 1991.
7. A. Califano and I. Rigoutsos. FLASH: A fast lookup algorithm for string homology. In Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, Bethesda, MD, July 1993.
8. W. G. Cochran. Sampling Techniques. Wiley, 1977.
9. V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Transactions on Knowledge and Data Engineering, 5(6):926-938, Dec. 1993.
10. W. J. Frawley, G. Piatetsky-Shapiro, and C. J. Matheus. Knowledge discovery in databases: An overview. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pages 1-27. AAAI/?I? Press, 1991.
11. K. A. Frenkel. The human genome project and informatics. Communications of the ACM, 34(11):41-51, Nov. 1991.
12. G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, Massachusetts, 2 edition, 1991.
13. P. J. Haas and A. N. Swami. Sequential sampling procedures for query size estimation. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, pages 341-350, San Diego, CA, June 1992.
14. J. Han, Y. Cai, and N. Cercone. Knowledge discovery in databases: An attribute-oriented approach. In Proceedings of the 18th International Conference on Very Large Data Bases, pages 547-559, Vancouver, Canada, Aug. 1992.
15. S. Henikoff and J. G. Henikoff. Automated assembly of protein blocks for database searching. Nucleic Acids Research, 19(23):6565-6572, 1991.
16. W. C. Hou and G. Ozsoyoglu. Statistical estimators for aggregate relational algebra queries. ACM Transactions on Database Systems, 16(4):600-654, Dec. 1991.
17. L. C. K. Hui. Color set size problem with applications to string matching. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science, 644, pages 230-243. Springer-Verlag, 1992.
18. L. Hunter, editor. Artificial Intelligence and Molecular Biology. AAAI Press/The MIT Press, Menlo Park, CA, 1993.
19. N. Kamel, M. Delobel, T. G. Marr, R. Robbins, J. Thierry-Mieg, and A. Tsugita. Data and knowledge bases for genome mapping: What lies ahead? Panel Presentation in the 17th International Conference on Very Large Data Bases, Barcelona, Spain, Sep. 1991.
20. G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms, 10(2):157-169, 1989.
21. R. J. Lipton, T. G. Marr, and J. D. Welsh. Computational approaches to discovering semantics in molecular biology. Proceedings of the IEEE, 77(7):1056-1060, July 1989.
22. R. J. Lipton, J. F. Naughton, and D. A. Schneider. Practical selectivity estimation through adaptive sampling. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pages 1-12, Atlantic City, NJ, May 1990.
23. E. M. McCreight. A space-economical suffix tree construction algorithm. JACM, 23:262-272, 1976.
24. D. R. Morrison. PATRICIA - practical algorithm to retrieve information coded in alphanumeric. JACM, 15(4):514-534, 1968.
25. F. Olken and D. Rotem. Random sampling from B+ trees. In Proceedings of the 15th International Conference on Very Large Data Bases, pages 269-278, Amsterdam, The Netherlands, Aug. 1989.
26. M. A. Roytberg. A search for common patterns in many sequences. Computer Applications in the Biosciences, 8(1):57-64, 1992.
27. D. Sankoff and J. B. Kruskal, editors. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA, 1983.
28. B. A. Shapiro and K. Zhang. Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences, 6(4):309-318, 1990.
29. D. Shasha, J. T. L. Wang, K. Zhang, and F. Y. Shih. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics, 24(3), March 1994.
30. D. Shasha and T. L. Wang. New techniques for best-match retrieval. ACM Transactions on Information Systems, 8(2):140-158, Apr. 1990.
31. A. Silberschatz, M. Stonebraker, and J. D. Ullman. Database systems: Achievements and opportunities. Communications of the ACM, 34(10):94-109, 1991.
32. B. Subramanian, S. B. Zdonik, T. W. Leung, and S. L. Vandenberg. Ordered types in the AQUA data model. In C. Beeri, A. Ohori, and D. Shasha, editors, Database Programming Languages (DBPL4), Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages, pages 115-135. Springer-Verlag, Workshops in Computing Series, 1994.
33. S. Tsur. Data dredging. IEEE Data Engineering Bulletin, 13(4):58-63, Dec. 1990.
34. M. Vingron and P. Argos. A fast and sensitive multiple sequence alignment algorithm. Computer Applications in the Biosciences, 5:115-122, 1989.
35. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. JACM, 21(1): 168-173, Jan. 1974.
36. J. T. L. Wang, K. Zhang, K. Jeong, and D. Shasha. A system for approximate tree matching. IEEE Transactions on Knowledge and Data Engineering, 6(2), April 1994.
37. T. L. Wang and D. Shasha. Query processing for distance metrics. In Proceedings of the 16th International Conference on Very Large Data Bases, pages 602-613, Brisbane, Australia, Aug. 1990.
38. M. S. Waterman, editor. Mathematical Methods for DNA Sequence Analysis. CRC Press, Boca Raton, FL, 1989.
39. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, Oct. 1992.
40. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Computing, 18(6):1245-1262, Dec. 1989.
41. K. Zhang, D. Shasha, and J. T. L. Wang. Approximate tree matching in the presence of variable length don't cares. Journal of Algorithms, 16(1):33-66, Jan. 1994.
42. G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison Wesley, Reading, MA, 1949.