The following pages link to Extracting approximate patterns (Q2569404):
Displaying 6 items.
- 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)
- 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)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES (Q3069742) (← links)
