Efficient seed computation revisited

DOI10.1016/J.TCS.2011.12.078MaRDI QIDQ390905zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

Recommendations

• Efficient seeds computation revisited
• On left and right seeds of a string
• On the right-seed array of a string

Cites work

• scientific article; zbMATH DE number 1615296 (Why is no real title available?)
• scientific article; zbMATH DE number 1003283 (Why is no real title available?)
• scientific article; zbMATH DE number 2038766 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Algorithms on Strings
• An on-line string superprimitivity test
• Computing the cover array in linear time
• Covering a string
• Efficient detection of quasiperiodicities in strings
• Efficient seeds computation revisited
• Efficient string matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Jewels of Stringology
• Optimal superprimitivity testing for strings
• Space efficient linear time construction of suffix arrays
• The subtree max gap problem with application to parallel string covering

Cited in

(10)

• Efficient algorithms for shortest partial seeds in words
• String Covering: A Survey
• On left and right seeds of a string
• On the right-seed array of a string
• Longest property-preserved common factor: a new string-processing framework
• Experimental evaluation of algorithms for computing quasiperiods
• Computing the λ-Seeds of a String
• Quasi-Periodicity in Streams
• Shortest covers of all cyclic shifts of a string
• Efficient seeds computation revisited

This page was built for publication: Efficient seed computation revisited

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