On left and right seeds of a string

DOI10.1016/j.jda.2012.10.004zbMath1267.68325OpenAlexW2017946141MaRDI QIDQ2376787

Ondřej Guth, Costas S. Iliopoulos, Maxime Crochemore, Michalis Christou, Solon P. Pissis

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.10.004

zbMATH Keywords

seedsperiodicityquasiperiodicity

Mathematics Subject Classification ID

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

Related Items

String Covering: A Survey, Experimental evaluation of algorithms for computing quasiperiods, Shortest covers of all cyclic shifts of a string, Quasi-Periodicity in Streams

Cites Work

• Efficient seed computation revisited
• A work-time optimal algorithm for computing all string covers
• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An optimal algorithm for computing the repetitions in a word
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Covering a string
• The subtree max gap problem with application to parallel string covering
• On the Right-Seed Array of a String
• RECONSTRUCTING A SUFFIX ARRAY
• Fast Pattern Matching in Strings
• A Linear-Time Algorithm for Seeds Computation
• REVERSE ENGINEERING PREFIX TABLES
• Mathematical Foundations of Computer Science 2003
• Algorithms on Strings
• Computing the cover array in linear time
• Unnamed Item
• Unnamed Item
• Unnamed Item