Optimal string mining under frequency constraints

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

Volumn 4213 LNAI, Issue , 2006, Pages 139-150

  Fischer, Johannes ^a   Heun, Volker ^a   Kramer, Stefan ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOLOGY; CONSTRAINT THEORY; DATA STRUCTURES; TREES (MATHEMATICS);

ARRAY-BASED DATA STRUCTURES; COMPUTATIONAL BIOLOGY; DYNAMIC DATA STRUCTURES; OPTIMAL ALGORITHMS;

DATA MINING;

EID: 33750309692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871637_17     Document Type: Conference Paper

References (22)

1. Birzele, F., Kramer, S.: A new representation for protein secondary structure prediction based on frequent patterns. Submitted to Bioinformatics
2. Fischer, J., Kramer, S., Heun, V.: Fast frequent string mining using suffix arrays. In: Proc. ICDM, IEEE Computer Society (2005) 609-612
3. Gonnet, G.H., Baeza-Yates, R.A., Snider, T.: New indices for text: PAT trees and PAT arrays. In Frakes, W.B., Baeza-Yates, R.A., eds.: Information Retrieval: Data Structures and Algorithms. Prentice-Hall (1992) 66-82
4. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5) (1993) 935-948
5. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proc. CPM. Volume 2089 of LNCS. Springer (2001) 181-192
6. Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2) (1993) 221-242
7. Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Proc. CPM. Volume 4009 of LNCS. Springer (2006) 36-48
8. Wang, L., Zhao, H., Dong, G., Li, J.: On the complexity of finding emerging patterns. In: Proc. COMPSAC - Workshops and Fast Abstracts, IEEE Press (2004) 126-129
9. Chan, S., Kao, B., Yip, C.L., Tang, M.: Mining emerging substrings. In: Proc. DASFAA, IEEE Computer Society (2003) 119-126
10. De Raedt, L., Jäger, M., Lee, S.D., Mannila, H.: A theory of inductive query answering. In: Proc. ICDM, IEEE Computer Society (2002) 123-130
11. Lee, S.D., De Raedt, L.: An efficient algorithm for mining string databases under constraints. In: Proc. KDID 2004. Volume 3377 of LNCS. Springer (2005) 108-129
12. Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: Proc. KDD, ACM Press (1999) 43-52
13. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Proc. CPM. Volume 2676 of LNCS. Springer (2003) 200-210
14. Schürmann, K.B., Stoye, J.: An incomplex algorithm for fast suffix array construction. In: Proceedings of ALENEX/ANALCO, SIAM Press (2005) 77-85
15. Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40(1) (2004) 33-50
16. Manzini, G.: Two space saving tricks for linear time lcp array computation. In: Proc. SWAT. Volume 3111 of LNCS. Springer (2004) 372-383
17. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk. SSSR 194 (1970 (in Russian)) 487-488
18. English translation in Soviet Math. Dokl., 11: 1209-1210, 1975.
19. Hui, L.C.K.: Color set size problem with application to string matching. In: Proc. CPM. Volume 644 of LNCS. Springer (1992) 230-243
20. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)
21. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1) (2004) 53-86
22. Phan, I.Q.H., Pilbout, S.F., Fleischmann, W., Bairoch, A.: NEWT, a new taxonomy portal. Nucleic Acids Res 31(13) (2003) 3822-3823