Enhanced string covering

DOI10.1016/j.tcs.2013.08.013zbMath1301.68211OpenAlexW2088906714MaRDI QIDQ393116

Tomáš Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Wojciech Tyczyński, Simon J. Puglisi, W. F. Smyth, Solon P. Pissis

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.013

zbMATH Keywords

seedsperiodicitycoversquasiperiodicity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

Computing covers using prefix tables ⋮ Can we recover the cover? ⋮ String Covering: A Survey ⋮ Subsequence covers of words ⋮ Efficient algorithms for shortest partial seeds in words ⋮ Crochemore's partitioning on weighted strings and applications ⋮ Experimental evaluation of algorithms for computing quasiperiods ⋮ Efficient Computation of 2-Covers of a String. ⋮ Fast algorithm for partial covers in words ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ String covering with optimal covers ⋮ On approximate enhanced covers under Hamming distance ⋮ Quasi-Periodicity in Streams ⋮ Approximate cover of strings ⋮ Quasi-Periodicity Under Mismatch Errors ⋮ \(k\)-approximate quasiperiodicity under Hamming and edit distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New complexity results for the \(k\)-covers problem
• A work-time optimal algorithm for computing all string covers
• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Computing regularities in strings: a survey
• Efficient Seeds Computation Revisited
• On the Right-Seed Array of a String
• Fast Pattern Matching in Strings
• Algorithms on Strings
• Computing the cover array in linear time