Covers in optimal space
From MaRDI portal
Cites work
- Algorithms for computing the \(\lambda\)-regularities in strings
- An on-line string superprimitivity test
- Approximate cover of strings
- Computing the \(\lambda \)-covers of a string
- Computing the cover array in linear time
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- Efficient Computation of 2-Covers of a String.
- Efficient detection of quasiperiodicities in strings
- Enhanced string covering
- Fast Pattern Matching in Strings
- Finding the cyclic covers of a string
- scientific article; zbMATH DE number 1003283 (Why is no real title available?)
- scientific article; zbMATH DE number 7651096 (Why is no real title available?)
- scientific article; zbMATH DE number 7695998 (Why is no real title available?)
- Internal pattern matching in small space and applications
- Internal pattern matching queries in a text and applications
- Internal Quasiperiod Queries
- Linear-time computation of cyclic roots and cyclic covers of a string
- Locally Consistent Parsing for Text Indexing in Small Space
- Optimal superprimitivity testing for strings
- Periods in strings
- Real-time streaming string-matching
- Space-efficient algorithms for longest increasing subsequence
- String 2-covers with no length restrictions
- String Covering: A Survey
- String covers of a tree
- String covers of a tree revisited
- The complexity of the minimum k-cover problem
- Time-space-optimal string matching
- Two-way string-matching
This page was built for publication: Covers in optimal space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299436)
