The following pages link to Extracting approximate patterns (Q2569404):
Displaying 14 items.
- Missing pattern discovery (Q553949) (← links)
- Extracting string motif bases for quorum higher than two (Q690488) (← links)
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← 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)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- An inexact-suffix-tree-based algorithm for detecting extensible patterns (Q1781986) (← links)
- Some methods for ``normalizing'' patterns (Q1878779) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Output-sensitive pattern extraction in sequences (Q2978522) (← links)
- OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES (Q3069742) (← links)
- Extracting Approximate Patterns (Q3550845) (← links)
- (Q3842795) (← links)
