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...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Discrete Mathematics & Theoretical Computer Science
2017-10-01
|
| Serie: | Discrete Mathematics & Theoretical Computer Science |
| Soggetti: | |
| Accesso online: | https://dmtcs.episciences.org/1337/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|