A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

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

Volumn 3827 LNCS, Issue , 2005, Pages 724-737

  Arimura, Hiroki ^a   Uno, Takeaki ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; POLYNOMIALS; PROBLEM SOLVING;

ENUMERATION; POLYNOMIAL DELAY ALGORITHMS; POLYNOMIAL TIME COMPUTABILITY; PREFIX-PRESERVING CLOSURE EXTENSION;

ALGORITHMS;

EID: 33744955004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_73     Document Type: Conference Paper

References (17)

1. A. Apostolico and L. Parida, Compression and the wheel of fortuné, In Proc. the 2003 Data Compression Conference (DCC'03), IEEE, 2003.
2. H. Arimura, T. Uno, A polynomial space polynomial delay algorithm for enumeration of maximal motifs in a sequence, Technical Report Series A, TCS-TR-A-05-6, Division of Computer Science, Hokkaido Univeristy, July 2005 http://www-alg.ist.hokudai.ac.jp/tra.html
3. H. Arimura, T. Uno, An output-polynomial time algorithm for mining frequent closed attribute trees, In Proc. ILP'05, LNAI 3625, 1-19, August 2005.
4. H. Arimura, T. Shinohara, S. Otsuki, Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, In STACS'94, LNCS 775, Springer-Verlag, 649-660, 1994.
5. E. Boros V. Gurvich, L. Khachiyan, K. Makino, The complexity of generating maximal frequent and minimal infrequent sets, In Proc. STACS'02, LNCS, 133-141, 2002.
6. M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, 2002.
7. L. A. Goldberg, Polynomial space polynomial delay algorithms for listing families of graphs, In Proc. the 25th STOC, ACM, 218-225, 1993.
8. D. Gusfield, Algorithms on strings, trees, and sequences, Cambridge, 1997.
9. L. Parida, I. Rigoutsos, A. Floratos, D. Platt, and Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and effcient polynomial time algorithm, In Proc. the 11th SIAM Symposium on Discrete Algorithms (SODA'00), 297-308, 2000.
10. L. Parida, I. Rigoutsos, D. E. Platt, An Output-Sensitive Flexible Pattern Discovery Algorithm. In Proc. CPM'01, LNCS 2089, 131-142, 2001.
11. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, In Proc. ICDT'99, 398-416, 1999.
12. J. Pelfrêne, S. Abdeddaim, and J. Alexandre, Extending Approximate Patterns, In Proc. CPM'03, LNCS 2676, 328-347, 2003.
13. N. Pisanti, M. Crochemore, R. Grossi, and M.-F. Sagot, A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum, In Proc. MFCS'03, LNCS 2747, 622-631, 2003.
14. N. Pisanti, M. Crochemore, R. Grossi, and M.-F. Sagot, A comparative study of bases for motif inference, In String Algorithmics, KCL publications, 2004.
15. T. Uno, Two general methods to reduce delay and change of enumeration algorithms, NII Technical Report, NII-2003-004E, April 2003.
16. T. Uno, T. Asai, Y. Uchida, H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, In Proc. DS'04, LNAI 3245, 16-30, 2004.
17. X. Yan, J. Han, CloseGraph: Mining Closed Frequent Graph Patterns In Proc. SIGKDD'03, 2003.