A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence-Reference-Cited by-同舟云学术

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence

Published:2005 Issue: Volume: Page:724-737
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Arimura Hiroki,Uno Takeaki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11602613_73.pdf

Reference17 articles.

1. Apostolico, A., Parida, L.: Compression and the wheel of fortune. In: Proc. the 2003 Data Compression Conference (DCC 2003). IEEE, Los Alamitos (2003)

2. Arimura, H., Uno, T.: 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. Lecture Notes in Artificial Intelligence;H. Arimura,2005

4. Lecture Notes in Computer Science;H. Arimura,1994

5. Lecture Notes in Computer Science;E. Boros,1982

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining Frequent Partite Episodes with Partwise Constraints;New Frontiers in Mining Complex Patterns;2014

2. A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration;Machine Learning and Knowledge Discovery in Databases;2014

3. MINING APPROXIMATE REPEATING PATTERNS FROM SEQUENCE DATA WITH GAP CONSTRAINTS;Computational Intelligence;2011-08

4. Mining Frequent k-Partite Episodes from Event Sequences;New Frontiers in Artificial Intelligence;2010

5. Maximal and minimal representations of gapped and non-gapped motifs of a string;Theoretical Computer Science;2009-10