Internal quasiperiod queries
From MaRDI portal
Cites work
- A linear time algorithm for seeds computation
- A linear-time algorithm for seeds computation
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Computing the cover array in linear time
- Constructing Efficient Dictionaries in Close to Sorting Time
- Covering a string
- Efficient representation and counting of antipower factors in words
- Experimental evaluation of algorithms for computing quasiperiods
- Extracting powers and periods in a word from its runs structure
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 7695994 (Why is no real title available?)
- Internal pattern matching queries in a text and applications
- Internal pattern matching queries in a text and applications
- Internal Quasiperiod Queries
- Linear time construction of cover suffix tree and applications
- Linear work suffix array construction
- Linear-time computation of shortest covers of all rotations of a string
- Optimal superprimitivity testing for strings
- Quasi-Periodicity in Streams
- Shortest cover after edit
- Shortest covers of all cyclic shifts of a string
- String Covering: A Survey
- Testing string superprimitivity in parallel
- The ``runs theorem
- The maximal number of cubic runs in a word
- The subtree max gap problem with application to parallel string covering
- Weighted ancestors in suffix trees
This page was built for publication: Internal quasiperiod queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858871)