The following pages link to Algorithms on Strings (Q5444160):
Displayed 50 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Using minimal absent words to build phylogeny (Q442159) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Asynchronous trace-matching automata (Q466372) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Cross-bifix-free sets in two dimensions (Q517032) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- Negative selection algorithms on strings with efficient training and linear-time classification (Q627104) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- The extended equation of Lyndon and Schützenberger (Q730507) (← links)
- Invariants for time-series constraints (Q823762) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- String powers in trees (Q1679231) (← links)