Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Data Structures and Algorithms
2019-02-01 v1
Abstract
We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings and of length , we are to compute the longest factor of whose cyclic shift occurs as a factor of . It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in time.
Keywords
Cite
@article{arxiv.1901.11305,
title = {Quasi-Linear-Time Algorithm for Longest Common Circular Factor},
author = {Mai Alzamel and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszyński and Tomasz Waleń and Wiktor Zuba},
journal= {arXiv preprint arXiv:1901.11305},
year = {2019}
}