Finding top-k longest palindromes in substrings

Palindromes are strings that read the same forward and backward. Problems of computing palindromic structures in strings have been studied for many years with the motivation of their application to biology. The longest palindrome problem is one of the most important and classical problems regarding...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 979; s. 114183
Hlavní autori:	Mitani, Kazuki, Mieno, Takuya, Seto, Kazuhisa, Horiyama, Takashi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 10.11.2023
Predmet:	Internal queries Palindromes String algorithms Top-k queries String algorithms Palindromes Internal queries Top-k queries
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!