Efficient Computation of 2-Covers of a String.
From MaRDI portal
Publication:5874549
DOI10.4230/LIPICS.ESA.2020.77OpenAlexW3082037367MaRDI QIDQ5874549FDOQ5874549
Authors: Juliusz Straszyński, Jakub Radoszewski 
Publication date: 7 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12943/pdf/LIPIcs-ESA-2020-77.pdf/
Cites Work
- Algorithms on Strings, Trees and Sequences
- Linear work suffix array construction
- Title not available (Why is that?)
- The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications
- Jewels of Stringology
- An optimal algorithm for computing the repetitions in a word
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Uniqueness Theorems for Periodic Functions
- An O(n log n) algorithm for finding all repetitions in a string
- Dynamic ordered sets with exponential search trees
- Deterministic sorting in O(nloglogn) time and linear space
- Internal Pattern Matching Queries in a Text and Applications
- Algorithms on Strings
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Computing covers using prefix tables
- Enhanced string covering
- The “Runs” Theorem
- Computing the cover array in linear time
- Optimal superprimitivity testing for strings
- Two-dimensional prefix string matching and covering on square matrices
- The complexity of the minimum \(k\)-cover problem
- Covering a string
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient detection of quasiperiodicities in strings
- The minimum substring cover problem
- Covering problems for partial words and for indeterminate strings
- Efficient algorithms for shortest partial seeds in words
- Fast algorithm for partial covers in words
- A Linear-Time Algorithm for Seeds Computation
- Computing the \(\lambda \)-covers of a string
- Algorithms for computing the \(\lambda\)-regularities in strings
- Testing string superprimitivity in parallel
- Title not available (Why is that?)
- Elementariness of a finite set of words is co-NP-complete
- Approximate seeds of strings
- Indexing weighted sequences: neat and efficient
- Approximate cover of strings
- Can we recover the cover?
- An output-sensitive algorithm for the minimization of 2-dimensional string covers
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Quasi-Periodicity in Streams
- Solving the Minimum String Cover Problem
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)
