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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 979; p. 114183
Main Authors:	Mitani, Kazuki, Mieno, Takuya, Seto, Kazuhisa, Horiyama, Takashi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 10.11.2023
Subjects:	Internal queries Palindromes String algorithms Top-k queries String algorithms Palindromes Internal queries Top-k queries
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!