Discovering subword associations in strings in time linear in the output size

Journal of Discrete Algorithms

Volumn 7, Issue 2, 2009, Pages 227-238

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

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Association rule; Pattern matching; String searching; Substring statistics; Subword tree; Tandem index

Indexed keywords

STRING SEARCHING; SUBSTRING STATISTICS; SUBWORD TREE; SUBWORDS; TANDEM INDEX; TEXT STRINGS; TIME AND SPACES;

ASSOCIATIVE PROCESSING; PATTERN MATCHING; TERMINOLOGY;

ASSOCIATION RULES;

EID: 64149088998     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2007.02.003     Document Type: Article

References (23)

1. Agrawal R., Imielinski T., and Swami A. Mining association rules between sets of items in large databases. SIGMOD '93: Proceedings of the 1993 ACM Sigmod International Conference on Management of Data. New York, NY, USA (1993), ACM Press 207-216
2. In: Apostolico A., and Galil Z. (Eds). Pattern Matching Algorithms (1997), Oxford University Press
3. A. Apostolico, C. Pizzi, G. Satta, Optimal discovery of subword associations in strings, in: Discovery Science, 2004, pp. 270-277
4. Blumer A., Blumer J., Ehrenfeucht A., Haussler D., Chen M.T., and Seiferas J. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40 1 (1985) 31-55
5. E. Brill, Transformation-based error-driven learning and natural language processing: A case study in part of speech tagging, in: Computational Linguistics, 1995
6. Brodal G.S., Lyngsø R.B., Pedersen C.N.S., and Stoye J. Finding maximal pairs with bounded gap. In: Crochemore M., and Paterson M. (Eds). Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching. Warwick University, UK. Lecture Notes in Computer Science vol. 1645 (1999), Springer-Verlag, Berlin 134-149
7. Cancedda N., Gaussier E., Goutte C., and Renders J.M. Word sequence kernels. J. Mach. Learn. Res. 3 (2003) 1059-1082
8. Crochemore M., and Rytter W. Text Algorithms (1994), Oxford University Press
9. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, Cambridge
10. S. Inenaga, H. Bannai, H. Hyyrö, A. Shinohara, M. Takeda, K. Nakai, S. Miyano, Finding optimal pairs of cooperative and competing patterns with bounded distance, in: Discovery Science, 2004, pp. 32-46
11. Karlsson F., Voutilainen A., Heikkilä J., and Anttila A. Constraint Grammar. A Language Independent System for Parsing Unrestricted Text (1995), Mouton de Gruyter
12. Kolpakov R., and Kucherov G. Finding repeats with fixed gap. SPIRE '00: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00). Washington, DC, USA (2000), IEEE Computer Society 162-168
13. Landau G.M., and Schmidt J.P. An algorithm for approximate tandem repeats. In: Apostolico A., Crochemore M., Galil Z., and Manber U. (Eds). Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching. Padova, Italy. Lecture Notes in Computer Science vol. 684 (1993), Springer-Verlag, Berlin 120-133
14. Manning C.D., and Schütze H. Foundations of Statistical Natural Language Processing (1999), Massachusetts Institute of Technology
15. McCreight E.M. A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 23 2 (1976) 262-272
16. Piatesky-Shapiro G., and Frawley W.J. Knowledge Discovery in Databases (1991), AAAI Press/MIT Press
17. Schieber B., and Vishkin U. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17 6 (1988) 1253-1262
18. Shimozono S., Arimura H., and Arikawa S. Efficient discovery of optimal word-association patterns in large text databases. New Gen. Comput. 18 1 (2000) 49-60
19. Stoye J., and Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree. Theor. Comput. Sci. 270 1-2 (2002) 843-850
20. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 3 (1995) 249-260
21. van Helden J., Rios A.F., and Collado-Vides J. Discovering regulatory elements in non-coding sequences by analysis of spaced dyads. Nucleic Acid Res. 28 8 (2000) 1808-1818
22. Wang J.T.-L., Chirn G.-W., Marr T.G., Shapiro B., Shasha D., and Zhang K. Combinatorial pattern discovery for scientific data: some preliminary results. SIGMOD '94: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. New York, NY, USA (1994), ACM Press 115-125
23. P. Weiner, Linear pattern matching algorithm, in: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, 1973, pp. 1-11