Computing the \(\lambda \)-covers of a string

DOI10.1016/j.ins.2007.02.020zbMath1126.68059OpenAlexW2055821317MaRDI QIDQ2384518

Qing Guo, Hui Zhang, Costas S. Iliopoulos

Publication date: 10 October 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.02.020

zbMATH Keywords

equivalence classstring regularities\(\lambda \)-combinations\(\lambda \)-cover problemgeneral \(\lambda \)-cover problem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

String Covering: A Survey, Experimental evaluation of algorithms for computing quasiperiods, Efficient Computation of 2-Covers of a String., Computing regularities in strings: a survey, New complexity results for the \(k\)-covers problem, Generalized approximate regularities in strings, Quasi-Periodicity in Streams, A Linear-Time Algorithm for Seeds Computation

Cites Work

• Unnamed Item
• A work-time optimal algorithm for computing all string covers
• Optimal superprimitivity testing for strings
• An optimal algorithm for computing the repetitions in a word
• An on-line string superprimitivity test
• Property Matching and Weighted Matching
• Computing the cover array in linear time