文章基本信息

标题：Palindromic Length in Linear Time
本地全文：下载
作者：Kirill Borozdin ; Dmitry Kosolobov ; Mikhail Rubinchik 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：78
页码：23:1-23:12
DOI：10.4230/LIPIcs.CPM.2017.23
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to this string. The problem of finding the palindromic length drew some attention, and a few O(n log n) time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem.
关键词：palindrome; palindromic length; palindromic factorization; online