The following pages link to Words and forbidden factors (Q1605329):
Displaying 20 items.
- Cyclic complexity of words (Q507796) (← links)
- Minimal forbidden subwords (Q834943) (← links)
- Reconstruction of a word from a multiset of its factors (Q930915) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Computing minimal unique substrings for a sliding window (Q2118202) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- Languages with mismatches (Q2456367) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- On the structure of bispecial Sturmian words (Q2637643) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Suffix conjugates for a class of morphic subshifts (Q2942567) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Characteristic measures for language stable subshifts (Q6097047) (← links)
