Optimal discovery of subword associations in strings (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3245, Issue , 2004, Pages 270-277

  Apostolico, Alberto ^a   Pizzi, Cinzia ^b   Satta, Giorgio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

^b Purdue University   (United States)

Author keywords

Association Rule; Pattern Matching; String Searching; Substring Statistics; Subword Tree; Tandem Index

Indexed keywords

ARTIFICIAL INTELLIGENCE; ASSOCIATION RULES; COMPUTERS;

STRING-SEARCHING; SUB WORDS; SUBSTRING; TANDEM INDEX;

PATTERN MATCHING;

EID: 35048892540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30214-8_21     Document Type: Article

References (19)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In Proc. ACM SIGMOD, 207-216, Washington DC May 1993.
2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass (1974)
3. Apostolico, A., Galil,Z. (Eds.): Pattern Matching Algorithms, Oxford University Press, New York (1997)
4. Arimura, H., Arikawa, S.: Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Generation Computing, 18: 49-60 (2000)
5. Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Chen, M.T. and Seiferas, J.: The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science , 40: 31-55 (1985).
6. Brill, E.: Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging, Computational Linguistics (1995)
7. Crochemore, M., Rytter, W.: Text Algorithms, Oxford University Press, New York (1994)
8. Han, J., and Kamber, M.: Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2000.
9. Karlsson, F., Voutilainen, A., Heikkilä, F., and Anttila, A.: Constraint Grammar. A Language Independent System for Parsing Unrestricted Text. Mouton de Gruyter (1995)
10. Manning C.D. , Schütze, H.: Foundations of Statistical Natural Language Processing, MIT Press (1999)
11. Marcus, M. P., Santorini, B., and Marcinkiewicz, M.A.: Building a Large Annotated Corpus of English: The Penn Treebank, Computational Linguistics, 19(2):313-330 (1993)
12. McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2): 262-272, April 1976.
13. Na, J.C., Apostolico A., Iliopoulos C.S., Park K., Truncated Suffix Trees and their Application to Data Compression Theoretical Computer Science, Vol. 304, Issue 1-3, pp.87-101 (2003)
14. Piatesky-Shapiro, G., Frawley W.J. (eds.): Knowledge Discovery in Databases. AAAI Press/MIT Press (1991).
15. Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplifications and Parallelizations, SIAM Journal on Computing, 17:1253-1262 (1988)
16. Ukkonen, E.: On-line Construction of Suffix Trees. Algorithmic, 14(3): 249-260 (1995)
17. van Helden, J., Rios, A.F., Collado-Vides, J.: Discovering Regulatory Elements in Non-coding Sequences by Analysis of Spaced Dyads. Nucleic Acid Research, Vol.28, No.8: 1808-1818, 2000.
18. Wang, J. T.-L., Chirn, G.-W., Marr, T.G., Shapiro, B., Shasha, D., Zhang, K.: Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results. In Proceedings of 1994 SIGMOD, 115-125 (1994)
19. Weiner, P.:, Linear Pattern Matching algorithm. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1-11, Washington, DC (1973)