Pages that link to "Item:Q2271439"
From MaRDI portal
The following pages link to Efficient construction of maximal and minimal representations of motifs of a string (Q2271439):
Displaying 4 items.
- 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)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- String cadences (Q1676299) (← links)
