The following pages link to (Q4952632):
Displaying 14 items.
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Extracting string motif bases for quorum higher than two (Q690488) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- Suffix tree characterization of maximal motifs in biological sequences (Q732032) (← links)
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Optimal extraction of motif patterns in 2D (Q989557) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← 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)
- Irredundant tandem motifs (Q2437750) (← links)
- Algorithms for extracting motifs from biological weighted sequences (Q2457295) (← links)
- Extracting approximate patterns (Q2569404) (← links)
