Quasi-Periodicity in Streams
From MaRDI portal
Publication:5088913
DOI10.4230/LIPIcs.CPM.2019.22OpenAlexW2954380240MaRDI QIDQ5088913
Tatiana Starikovskaya, Paweł Gawrychowski, Jakub Radoszewski
Publication date: 18 July 2022
Full work available at URL: https://hal.science/hal-03942953
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing covers using prefix tables
- Efficient seed computation revisited
- Enhanced string covering
- Fast algorithm for partial covers in words
- New complexity results for the \(k\)-covers problem
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Efficient algorithms for shortest partial seeds in words
- String covering with optimal covers
- Covering a string
- On approximate enhanced covers under Hamming distance
- On left and right seeds of a string
- Computing the \(\lambda \)-covers of a string
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Periodicity in Streams
- Efficient randomized pattern-matching algorithms
- Fast Pattern Matching in Strings
- Frequency Covers for Strings
- Real-Time Streaming String-Matching
- A Linear-Time Algorithm for Seeds Computation
- Quasi-Periodicity Under Mismatch Errors
- Exact and Approximate Pattern Matching in the Streaming Model
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Uniqueness Theorems for Periodic Functions
- Computing the λ-Seeds of a String
- Periodicity in data streams with wildcards
- Computing the cover array in linear time
