The following pages link to Jewels of Stringology (Q4451072):
Displaying 50 items.
- On del-robust primitive words (Q277635) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm (Q323035) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Non-expandable non-overlapping sets of pictures (Q346246) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Forbidden traces and forbidden subtraces (Q465957) (← links)
- Asynchronous trace-matching automata (Q466372) (← links)
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Simple tree pattern matching for trees in the prefix bar notation (Q496555) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Minimal forbidden subwords (Q834943) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Unbordered partial words (Q1028413) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
