Longest Gapped Repeats and Palindromes
A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show how to compute efficiently, for every position $i$ o...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
2017-10-01
|
| Edice: | Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| On-line přístup: | https://dmtcs.episciences.org/1337/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|