文章基本信息

标题：Palindrome Recognition In The Streaming Model
本地全文：下载
作者：Petra Berenbrink ; Funda Erg{\"u}n ; Frederik Mallmann-Trenn 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2014
卷号：25
页码：149-161
DOI：10.4230/LIPIcs.STACS.2014.149
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：A palindrome is defined as a string which reads forwards the same as backwards, like, for example, the string "racecar". In the Palindrome Problem, one tries to find all palindromes in a given string. In contrast, in the case of the Longest Palindromic Substring Problem, the goal is to find an arbitrary one of the longest palindromes in the string. In this paper we present three algorithms in the streaming model for the the above problems, where at any point in time we are only allowed to use sublinear space. We first present a one-pass randomized algorithm that solves the Palindrome Problem. It has an additive error and uses square root of n space. We also give two variants of the algorithm which solve related and practical problems. The second algorithm determines the exact locations of all longest palindromes using two passes and square root of n space. The third algorithm is a one-pass randomized algorithm, which solves the Longest Palindromic Substring Problem. It has a multiplicative error using only O(log(n)) space.
关键词：Palindromes; Streaming Model; Complementary Palindrome