Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.25
URN: urn:nbn:de:0030-drops-104961
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10496/
Alzamel, Mai ; Crochemore, Maxime ; Iliopoulos, Costas S. ; Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech ; Straszynski, Juliusz ; Walen, Tomasz ; Zuba, Wiktor
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{alzamel_et_al:LIPIcs:2019:10496,
author = {Mai Alzamel and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszynski and Tomasz Walen and Wiktor Zuba},
title = {{Quasi-Linear-Time Algorithm for Longest Common Circular Factor}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10496},
URN = {urn:nbn:de:0030-drops-104961},
doi = {10.4230/LIPIcs.CPM.2019.25},
annote = {Keywords: longest common factor, circular pattern matching, internal pattern matching, intersection of hyperrectangles}
}
| Keywords: | longest common factor, circular pattern matching, internal pattern matching, intersection of hyperrectangles | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
