Pages that link to "Item:Q1765295"
From MaRDI portal
The following pages link to Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295):
Displaying 9 items.
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- Discovery Science (Q5464541) (← links)
- (Q5874500) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)