Pages that link to "Item:Q3506935"
From MaRDI portal
The following pages link to Efficient Computation of Substring Equivalence Classes with Suffix Arrays (Q3506935):
Displaying 4 items.
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
