Pages that link to "Item:Q5958334"
From MaRDI portal
The following pages link to Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334):
Displaying 16 items.
- Order-preserving indexing (Q294954) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- String cadences (Q1676299) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for finding a minimum repetition representation of strings and trees (Q2446339) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- A sublinear time string prefix square detection algorithm (Q5473096) (← links)
- (Q5874500) (← links)