\(k\)-approximate quasiperiodicity under Hamming and edit distance
type: Item
instance of: scholarly article
title: \(k\)-approximate quasiperiodicity under Hamming and edit distance
author: Aleksander Kędzierski
author: Jakub Radoszewski
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495488
zbMATH Keywords: quasiperiodicity
zbMATH Keywords: approximate cover
zbMATH Keywords: approximate seed
zbMATH Keywords: Hamming distance
zbMATH Keywords: edit distance
MaRDI profile type: Publication
full work available at URL: s00453-021-00842-7
OpenAlex ID: W3173483591
cites work: Can we recover the cover?
cites work: Approximate cover of strings
cites work: Quasi-Periodicity Under Mismatch Errors
cites work: Efficient detection of quasiperiodicities in strings
cites work: Optimal superprimitivity testing for strings
cites work: An on-line string superprimitivity test
cites work: Q5446122
cites work: Jewels of Stringology
cites work: Experimental evaluation of algorithms for computing quasiperiods
cites work: Longest common substrings with \(k\) mismatches
cites work: Enhanced string covering
cites work: On covering problems of codes
cites work: On approximate enhanced covers under Hamming distance
cites work: Dynamic edit distance table under a general weighted cost function
cites work: Covering a string
cites work: On the complexity of \(k\)-SAT
cites work: Which problems have strongly exponential complexity?
cites work: Finding the Position of the k-Mismatch and Approximate Tandem Repeats
cites work: Q5874446
cites work: A dynamic edit distance table
cites work: A Linear-Time Algorithm for Seeds Computation
cites work: Efficient algorithms for shortest partial seeds in words
cites work: Fast algorithm for partial covers in words
cites work: Incremental String Comparison
cites work: Efficient string matching with k mismatches
cites work: Computing the cover array in linear time
cites work: An optimal algorithm to compute all the covers of a string
cites work: Approximate periods of strings
cites work: The String-to-String Correction Problem
cites work: A new algorithm for optimal 2-constraint satisfaction and its implications
DOI: 10.1007/S00453-021-00842-7
Recommended article: Q5874446
Recommended article: Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
Recommended article: Period Recovery over the Hamming and Edit Distances
Recommended article: Period recovery of strings over the Hamming and edit distances
Recommended article: 1+ ε approximation of tree edit distance in quadratic time
Recommended article: On approximate enhanced covers under Hamming distance
Recommended article: Q4787988
Recommended article: Q3368932
Recommended article: Quasiperiods, Subword Complexity and the Smallest Pisot Number
Recommended article: Q4607964
description: scientific article; zbMATH DE number 7495488