Enhanced string covering

DOI10.1016/J.TCS.2013.08.013MaRDI QIDQ393116zbMATH OpenOpenAlexFDO

Authors Tomáš Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczyński, 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

coversperiodicityquasiperiodicityseeds

Mathematics Subject Classification ID

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

Recommendations

• Covering a string
• Verifying an enhanced cover array in linear time
• Quasiperiodicity and string covering
• scientific article; zbMATH DE number 1003283
• An optimal algorithm to compute all the covers of a string

Cites work

• A work-time optimal algorithm for computing all string covers
• Algorithms on Strings
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Computing regularities in strings: a survey
• Computing the cover array in linear time
• Efficient detection of quasiperiodicities in strings
• Efficient seeds computation revisited
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• New complexity results for the k-covers problem
• On the right-seed array of a string
• Optimal superprimitivity testing for strings
• The complexity of the minimum k-cover problem

Cited in

(25)

• An on-line string superprimitivity test
• Efficient algorithms for shortest partial seeds in words
• Crochemore's partitioning on weighted strings and applications
• String covering with optimal covers
• Covering a string
• k-approximate quasiperiodicity under Hamming and edit distance
• Experimental evaluation of algorithms for computing quasiperiods
• On approximate enhanced covers under Hamming distance
• Approximate cover of strings
• An output-sensitive algorithm for the minimization of 2-dimensional string covers
• Can we recover the cover?
• Computing covers using prefix tables
• Fast algorithm for partial covers in words
• Linear-time computation of prefix table for weighted strings {\&} applications
• Quasi-Periodicity in Streams
• Quasi-periodicity under mismatch errors
• Verifying an enhanced cover array in linear time
• Enhanced covers of regular and indeterminate strings using prefix tables
• Efficient Computation of 2-Covers of a String.
• String Covering: A Survey
• Subsequence covers of words
• Approximation and fixed parameter algorithms for the approximate cover problem
• Subsequence covers of words
• Computing string covers in sublinear time
• Covers in optimal space

This page was built for publication: Enhanced string covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393116)