Efficient seed computation revisited

DOI10.1016/j.tcs.2011.12.078zbMath1292.68179OpenAlexW2172982750WikidataQ61677858 ScholiaQ61677858MaRDI QIDQ390905

Costas S. Iliopoulos, B. Szreder, Wojciech Rytter, Jakub Radoszewski, Marcin Kubica, Michalis Christou, Maxime Crochemore, Solon P. Pissis, Tomasz Walen

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.078

zbMATH Keywords

coversuffix treeseed in a stringshortest-seed algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items

On left and right seeds of a string, String Covering: A Survey, Experimental evaluation of algorithms for computing quasiperiods, Shortest covers of all cyclic shifts of a string, Longest property-preserved common factor: a new string-processing framework, Quasi-Periodicity in Streams

Cites Work

• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An on-line string superprimitivity test
• Covering a string
• The subtree max gap problem with application to parallel string covering
• Efficient Seeds Computation Revisited
• Fast Algorithms for Finding Nearest Common Ancestors
• Space Efficient Linear Time Construction of Suffix Arrays
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Efficient string matching
• Jewels of Stringology
• Algorithms on Strings
• Computing the cover array in linear time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item