Generalized approximate regularities in strings
From MaRDI portal
Publication:5451457
DOI10.1080/00207160701389168zbMath1135.68047OpenAlexW2146546991MaRDI QIDQ5451457
Qing Guo, Hui Zhang, Costas S. Iliopoulos
Publication date: 27 March 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701389168
equivalence class\(\lambda \)-combinationsgeneralized approximate string regularitiesminimum \(\lambda \)-cover problemminimum \(\lambda \)-seed problem
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A work-time optimal algorithm for computing all string covers
- Optimal superprimitivity testing for strings
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- An on-line string superprimitivity test
- Covering a string
- Computing the \(\lambda \)-covers of a string
- The subtree max gap problem with application to parallel string covering
- Computing the λ-Seeds of a String
- Computing the cover array in linear time
- Approximate periods of strings