Pages that link to "Item:Q996827"
From MaRDI portal
The following pages link to An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827):
Displaying 6 items.
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (Q4932736) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
