文章基本信息

标题：Quasi-Linear-Time Algorithm for Longest Common Circular Factor
本地全文：下载
作者：Mai Alzamel ; Maxime Crochemore ; Costas S. Iliopoulos 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：128
页码：1-14
DOI：10.4230/LIPIcs.CPM.2019.25
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings S and T of length at most n, we are to compute the longest factor of S whose cyclic shift occurs as a factor of T. It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in O(n log^4 n) time using O(n log^2 n) space.
关键词：longest common factor; circular pattern matching; internal pattern matching; intersection of hyperrectangles