String Covering: A Survey
From MaRDI portal
Publication:6145625
DOI10.3233/fi-222164arXiv2211.11856MaRDI QIDQ6145625
Publication date: 2 February 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.11856
Cites Work
- Efficient seed computation revisited
- Enhanced string covering
- Fast algorithm for partial covers in words
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- New complexity results for the \(k\)-covers problem
- A work-time optimal algorithm for computing all string covers
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- Implementing approximate regularities
- Replacing suffix trees with enhanced suffix arrays
- An optimal algorithm for computing the repetitions in a word
- The shortest common supersequence problem over binary alphabet is NP- complete
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Two-dimensional prefix string matching and covering on square matrices
- Repetitive perhaps, but certainly not boring
- Covering problems for partial words and for indeterminate strings
- Efficient algorithms for shortest partial seeds in words
- String covering with optimal covers
- Computing regularities in strings: a survey
- Covering a string
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- String covers of a tree
- Experimental evaluation of algorithms for computing quasiperiods
- Indexing weighted sequences: neat and efficient
- On approximate enhanced covers under Hamming distance
- Universal reconstruction of a string
- Approximate cover of strings
- An output-sensitive algorithm for the minimization of 2-dimensional string covers
- On left and right seeds of a string
- Computing the \(\lambda \)-covers of a string
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Can we recover the cover?
- The subtree max gap problem with application to parallel string covering
- INFERRING STRINGS FROM COVER ARRAYS
- Prefix Table Construction and Conversion
- Efficient Seeds Computation Revisited
- On the Right-Seed Array of a String
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Cover Array String Reconstruction
- Varieties of Regularities in Weighted Sequences
- Efficient string matching
- The Complexity of Some Problems on Subsequences and Supersequences
- Fast Pattern Matching in Strings
- Frequency Covers for Strings
- A Linear-Time Algorithm for Seeds Computation
- Quasi-Periodicity in Streams
- Quasi-Periodicity Under Mismatch Errors
- Computing Palindromic Factorizations and Palindromic Covers On-line
- Uniqueness Theorems for Periodic Functions
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
- Computing the λ-Seeds of a String
- Algorithms on Strings
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- Finding the Anticover of a String
- Efficient Computation of 2-Covers of a String.
- Shortest covers of all cyclic shifts of a string
- Shortest covers of all cyclic shifts of a string
- Computing the cover array in linear time
- Approximate periods of strings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
