The following pages link to (Q4454548):
Displaying 17 items.
- Enhanced string covering (Q393116) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- A new approach to the periodicity lemma on strings with holes (Q732016) (← links)
- Fast pattern-matching on indeterminate strings (Q954954) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- String covers of a tree (Q2146126) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences (Q4639924) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- String Covering: A Survey (Q6145625) (← links)
