Efficient Identification of k-Closed Strings
From MaRDI portal
Publication:5859637
DOI10.1142/S0129054120500288zbMath1483.68267OpenAlexW4252983749MaRDI QIDQ5859637
Hayam Alamro, Costas S. Iliopoulos, Mai Alzamel, Solon P. Pissis, Steven Watts, Wing-Kin Sung
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120500288
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Closed factorization
- Efficient string matching with k mismatches
- How to answer a small batch of RMQs or LCA queries in practice
- A Classification of Trapezoidal Words
- On the Number of Closed Factors in a Word
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
- Algorithms on Strings