The following pages link to Searching for Gapped Palindromes (Q3506939):
Displaying 12 items.
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Longest Gapped Repeats and Palindromes (Q2946337) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Searching of Gapped Repeats and Subrepetitions in a Word (Q5165607) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
