Computing the λ-Seeds of a String

DOI10.1007/11775096_28MaRDI QIDQ5434408zbMATH OpenOpenAlexFDO

Authors Qing Guo, Hui Zhang, Costas S. Iliopoulos

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_28

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Computing the \(\lambda \)-covers of a string
• Algorithms for computing the \(\lambda\)-regularities in strings
• Efficient seeds computation revisited
• Efficient seed computation revisited
• Covering a string

Cited in

(9)

• Period recovery of strings over the Hamming and edit distances
• Computing regularities in strings: a survey
• Experimental evaluation of algorithms for computing quasiperiods
• Computing the \(\lambda \)-covers of a string
• Quasi-Periodicity in Streams
• Generalized approximate regularities in strings
• Algorithms for computing the \(\lambda\)-regularities in strings
• String Covering: A Survey
• Approximation and fixed parameter algorithms for the approximate cover problem

This page was built for publication: Computing the λ-Seeds of a String

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