Algorithms for computing the -regularities in strings

MaRDI QIDQ5506327zbMATH OpenFDO

Authors Hui Zhang, Qing Guo, Costas S. Iliopoulos

Publication date 28 January 2009

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Generalized approximate regularities in strings
• Computing the \(\lambda \)-covers of a string
• Computing the λ-Seeds of a String
• Computing regularities in strings: a survey
• Implementing approximate regularities

Cited in

(17)

• Foreword: Algorithms, strings and theoretical approaches in the big data era -- special issue in honor of the 60th birthday of Professor Raffaele Giancarlo
• Computing regularities in strings: a survey
• Approximate cover of strings
• Computing the \(\lambda \)-covers of a string
• Can we recover the cover?
• Algorithms on strings. Translated from the 2001 French original
• scientific article; zbMATH DE number 6003273 (Why is no real title available?)
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• Quasi-Periodicity in Streams
• Quasi-periodicity under mismatch errors
• Three New Algorithms for Regular Language Enumeration
• Computing the λ-Seeds of a String
• Generalized approximate regularities in strings
• New complexity results for the k-covers problem
• Efficient Computation of 2-Covers of a String.
• String Covering: A Survey
• Covers in optimal space

This page was built for publication: Algorithms for computing the \(\lambda\)-regularities in strings

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