An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
DOI10.1007/S10878-006-9029-1zbMATH Open1123.68134OpenAlexW2012509730WikidataQ59278892 ScholiaQ59278892MaRDI QIDQ996827FDOQ996827
Authors: 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
Recommendations
- Algorithms and Computation
- Toward optimal motif enumeration.
- Efficient construction of maximal and minimal representations of motifs of a string
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
- Space and Time Efficient Algorithms for Planted Motif Search
- An algorithmic framework for motif discovery problems in weighted sequences
- An approximation algorithm for alignment of multiple sequences using motif discovery
- scientific article; zbMATH DE number 1945161
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
Data miningAlgorithmDelayEnumerationPattern discoveryPolynomial timeClosed itemsetClosed patternMaximal motifMotifSequence mining
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
- Algorithms on Strings, Trees and Sequences
- The complexity of computing the permanent
- Jewels of Stringology
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discovery Science
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- Title not available (Why is that?)
- Polynomial space polynomial delay algorithms for listing families of graphs
- Extracting Approximate Patterns
- Inductive Logic Programming
Cited In (11)
- Toward optimal motif enumeration.
- Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
- Suffix tree characterization of maximal motifs in biological sequences
- On the complexity of finding gapped motifs
- Reverse-safe text indexing
- Efficient construction of maximal and minimal representations of motifs of a string
- Motif trie: an efficient text index for pattern discovery with don't cares
- Maximal motif discovery in a sliding window
- Algorithms and Computation
- Mining top-\(k\) motifs with a SAT-based framework
- Pattern masking for dictionary matching: theory and practice
Uses Software
This page was built for publication: An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996827)
