Efficient Computation of 2-Covers of a String.
From MaRDI portal
Publication:5874549
Cites work
- scientific article; zbMATH DE number 1003282 (Why is no real title available?)
- scientific article; zbMATH DE number 1003283 (Why is no real title available?)
- scientific article; zbMATH DE number 2052918 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Algorithms for computing the \(\lambda\)-regularities in strings
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- An O(n log n) algorithm for finding all repetitions in a string
- 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
- An output-sensitive algorithm for the minimization of 2-dimensional string covers
- Approximate cover of strings
- Approximate seeds of strings
- Can we recover the cover?
- Computing covers using prefix tables
- Computing the \(\lambda \)-covers of a string
- Computing the cover array in linear time
- Covering a string
- Deterministic sorting in O(nloglogn) time and linear space
- Dynamic ordered sets with exponential search trees
- Efficient algorithms for shortest partial seeds in words
- Efficient detection of quasiperiodicities in strings
- Elementariness of a finite set of words is co-NP-complete
- Enhanced string covering
- Fast algorithm for partial covers in words
- Indexing weighted sequences: neat and efficient
- Internal pattern matching queries in a text and applications
- Jewels of Stringology
- Linear work suffix array construction
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Optimal superprimitivity testing for strings
- Quasi-Periodicity in Streams
- Solving the minimum string cover problem
- Testing string superprimitivity in parallel
- The ``runs theorem
- The complexity of the minimum \(k\)-cover problem
- The minimum substring cover problem
- The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Two-dimensional prefix string matching and covering on square matrices
- Uniqueness Theorems for Periodic Functions
Cited in
(3)
This page was built for publication: Efficient Computation of 2-Covers of a String.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874549)
