scientific article; zbMATH DE number 5244010
From MaRDI portal
Publication:5446122
zbMath1135.68021MaRDI QIDQ5446122
Costas S. Iliopoulos, Manolis Christodoulakis, Jeong Seop Sim, Kun Soo Park
Publication date: 6 March 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Approximation algorithms (68W25)
Related Items (12)
Can we recover the cover? ⋮ String Covering: A Survey ⋮ Efficient algorithms for shortest partial seeds in words ⋮ Experimental evaluation of algorithms for computing quasiperiods ⋮ Efficient Computation of 2-Covers of a String. ⋮ Generalized approximate regularities in strings ⋮ On approximate enhanced covers under Hamming distance ⋮ Quasi-Periodicity in Streams ⋮ A Linear-Time Algorithm for Seeds Computation ⋮ Approximate cover of strings ⋮ Quasi-Periodicity Under Mismatch Errors ⋮ \(k\)-approximate quasiperiodicity under Hamming and edit distance
This page was built for publication:
