An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- 9 December 2006
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 13 (3) , 243-262
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Conservative extraction of over-represented extensible motifsBioinformatics, 2005
- An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees2005
- Compression and the wheel of fortune2003
- Jewels of Stringology2002
- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets2002
- An Output-Sensitive Flexible Pattern Discovery Algorithm2001
- Discovering Frequent Closed Itemsets for Association Rules1999
- Algorithms on Strings, Trees and Sequences1997
- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive dataLecture Notes in Computer Science, 1994
- Polynomial space polynomial delay algorithms for listing families of graphs1993