On left and right seeds of a string
From MaRDI portal
Publication:2376787
Recommendations
Cites work
- A work-time optimal algorithm for computing all string covers
- Algorithms on Strings
- An on-line string superprimitivity test
- An optimal algorithm for computing the repetitions in a word
- An optimal algorithm to compute all the covers of a string
- Border array on bounded alphabet
- Computing the cover array in linear time
- Covering a string
- Efficient detection of quasiperiodicities in strings
- Efficient seed computation revisited
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 1874382 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- On the right-seed array of a string
- Optimal superprimitivity testing for strings
- RECONSTRUCTING A SUFFIX ARRAY
- Reverse engineering prefix tables
- The subtree max gap problem with application to parallel string covering
Cited in
(10)- Covering a string
- Experimental evaluation of algorithms for computing quasiperiods
- On the appearance of seeds in words
- Quasiperiodicities in Fibonacci strings.
- Efficient seeds computation revisited
- On the right-seed array of a string
- Efficient seed computation revisited
- Quasi-Periodicity in Streams
- Shortest covers of all cyclic shifts of a string
- String Covering: A Survey
This page was built for publication: On left and right seeds of a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376787)