Quasi-linear-time algorithm for a longest common circular factor
Authors:
- Mai AlzamelMAMai Alzamel
- Maxime CrochemoreMCMaxime Crochemore
- Costas S. IliopoulosCICostas S. Iliopoulos
- Tomasz KociumakaTKTomasz Kociumaka
- Jakub RadoszewskiJRJakub Radoszewski
- Wojciech RytterWRWojciech Rytter
- Juliusz StraszyńskiJSJuliusz Straszyński
- Tomasz WaleńTWTomasz Waleń
- Wiktor ZubaWZWiktor Zuba
- 7 April 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1075
Abstract
No abstract availableAll Related Versions
Funding Information
- Narodowe Centrum Nauki
- King Saud University
This publication has 22 references indexed in Scilit:
- Circular pattern matching with k mismatchesJournal of Computer and System Sciences, 2021
- Fast circular dictionary-matching algorithmMathematical Structures in Computer Science, 2015
- Alignment with non-overlapping inversions and translocations on two stringsTheoretical Computer Science, 2015
- Extracting powers and periods in a word from its runs structureTheoretical Computer Science, 2014
- All-Against-All Circular Pattern MatchingThe Computer Journal, 2011
- Average-optimal string matchingJournal of Discrete Algorithms, 2009
- Unbalanced translocation, a major chromosome alteration causing loss of heterozygosity in human lung cancerOncogene, 2008
- Lowest common ancestors in trees and directed acyclic graphsJournal of Algorithms, 2005
- A new approach to rectangle intersections part IInternational Journal of Computer Mathematics, 1983
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965