\(k\)-approximate quasiperiodicity under Hamming and edit distance
From MaRDI portal
Publication:2118198
DOI10.1007/s00453-021-00842-7OpenAlexW3173483591MaRDI QIDQ2118198
Aleksander Kędzierski, Jakub Radoszewski
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00842-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Enhanced string covering
- Dynamic edit distance table under a general weighted cost function
- Fast algorithm for partial covers in words
- On covering problems of codes
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- A dynamic edit distance table
- Efficient string matching with k mismatches
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Which problems have strongly exponential complexity?
- Efficient algorithms for shortest partial seeds in words
- Covering a string
- Experimental evaluation of algorithms for computing quasiperiods
- On approximate enhanced covers under Hamming distance
- Approximate cover of strings
- Longest common substrings with \(k\) mismatches
- Can we recover the cover?
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Incremental String Comparison
- The String-to-String Correction Problem
- Jewels of Stringology
- A Linear-Time Algorithm for Seeds Computation
- Quasi-Periodicity Under Mismatch Errors
- Finding the Position of the k-Mismatch and Approximate Tandem Repeats
- On the complexity of \(k\)-SAT
- Computing the cover array in linear time
- Approximate periods of strings
This page was built for publication: \(k\)-approximate quasiperiodicity under Hamming and edit distance
