Quasi-linear-time algorithm for a longest common circular factor
From MaRDI portal
Cites work
- A new approach to rectangle intersections part I
- Algorithms on Strings
- Alignment with non-overlapping inversions and translocations on two strings
- Approximate circular pattern matching
- Average-case optimal approximate circular string matching
- Average-optimal single and multiple approximate string matching
- Average-optimal string matching
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Circular pattern matching with \(k\) mismatches
- Extracting powers and periods in a word from its runs structure
- Fast circular dictionary-matching algorithm
- Indexing Circular Patterns
- Internal pattern matching queries in a text and applications
- Internal pattern matching queries in a text and applications
- Lowest common ancestors in trees and directed acyclic graphs
- On Abelian Longest Common Factor with and without RLE
- On the sorting-complexity of suffix tree construction
- Optimal square detection over general alphabets
- Searching and indexing circular patterns
- Sequence searching allowing for non-overlapping adjacent unbalanced translocations
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Suffix Arrays: A New Method for On-Line String Searches
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Quasi-linear-time algorithm for a longest common circular factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240324)
