Efficient seed computation revisited
From MaRDI portal
Publication:390905
DOI10.1016/J.TCS.2011.12.078zbMATH Open1292.68179DBLPjournals/tcs/ChristouCIKPRRSW13OpenAlexW2172982750WikidataQ61677858 ScholiaQ61677858MaRDI QIDQ390905FDOQ390905
Costas S. Iliopoulos, B. Szreder, Marcin Kubica, Michalis Christou, Wojciech Rytter, Maxime Crochemore, Jakub Radoszewski, 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
Recommendations
Cites Work
- Efficient string matching
- Title not available (Why is that?)
- Jewels of Stringology
- Title not available (Why is that?)
- Fast Algorithms for Finding Nearest Common Ancestors
- Algorithms on Strings
- An on-line string superprimitivity test
- Efficient Seeds Computation Revisited
- Computing the cover array in linear time
- Optimal superprimitivity testing for strings
- Space Efficient Linear Time Construction of Suffix Arrays
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Title not available (Why is that?)
- Covering a string
- The subtree max gap problem with application to parallel string covering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient detection of quasiperiodicities in strings
Cited In (8)
- String Covering: A Survey
- On left and right seeds 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
- A Linear-Time Algorithm for Seeds Computation
- Shortest covers of all cyclic shifts of a string
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)
