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

DOI10.1007/s10878-006-9029-1zbMath1123.68134OpenAlexW2012509730WikidataQ59278892 ScholiaQ59278892MaRDI QIDQ996827

Hiroki Arimura, Takeaki Uno

Publication date: 19 July 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9029-1

zbMATH Keywords

AlgorithmDelayData miningEnumerationPattern discoveryPolynomial timeClosed itemsetClosed patternMaximal motifMotifSequence mining

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Reverse-Safe Text Indexing ⋮ Motif trie: an efficient text index for pattern discovery with don't cares ⋮ Mining top-\(k\) motifs with a SAT-based framework ⋮ On the complexity of finding gapped motifs ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ Efficient construction of maximal and minimal representations of motifs of a string

Uses Software

• gSpan
• CloseGraph

Cites Work

• The complexity of computing the permanent
• Extracting Approximate Patterns
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Polynomial space polynomial delay algorithms for listing families of graphs
• Inductive Logic Programming
• Mathematical Foundations of Computer Science 2003
• Discovery Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence