Quasi-Linear-Time Algorithm for Longest Common Circular Factor
From MaRDI portal
Publication:5088916
DOI10.4230/LIPIcs.CPM.2019.25OpenAlexW4389712405MaRDI QIDQ5088916
Juliusz Straszyński, Mai Alzamel, Maxime Crochemore, Wiktor Zuba, Tomasz Kociumaka, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.11305
longest common factorinternal pattern matchingcircular pattern matchingintersection of hyperrectangles
Related Items
Cites Work
- Extracting powers and periods in a word from its runs structure
- Average-optimal string matching
- Alignment with non-overlapping inversions and translocations on two strings
- Average-Case Optimal Approximate Circular String Matching
- Dynamic text and static pattern matching
- Fast circular dictionary-matching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Searching and Indexing Circular Patterns
- A new approach to rectangle intersections part I
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- A Linear-Time Algorithm for Seeds Computation
- Locally Consistent Parsing for Text Indexing in Small Space
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Uniqueness Theorems for Periodic Functions
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
- Algorithms on Strings
- Indexing Circular Patterns
- Average-optimal single and multiple approximate string matching
- On the sorting-complexity of suffix tree construction
