The following pages link to (Q5458488):
Displayed 12 items.
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Content-dependent chunking for differential compression, the local maximum approach (Q972380) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Lyndon words, permutations and trees. (Q1426043) (← links)
- Languages with mismatches (Q2456367) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- Words over an ordered alphabet and suffix permutations (Q4800257) (← links)
- Indexing Circular Patterns (Q5452151) (← links)