Fast algorithm for partial covers in words
From MaRDI portal
Publication:493243
DOI10.1007/S00453-014-9915-3zbMATH Open1337.68307OpenAlexW2145381651WikidataQ59408430 ScholiaQ59408430MaRDI QIDQ493243FDOQ493243
Authors: Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń 
Publication date: 3 September 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9915-3
Recommendations
- Fast Algorithm for Partial Covers in Words
- Algorithmic combinatorics on partial words
- Efficient algorithms for shortest partial seeds in words
- Efficient Algorithms for Shortest Partial Seeds in Words
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- A work-time optimal algorithm for computing all string covers
Cites Work
- A Fast Merging Algorithm
- Jewels of Stringology
- Repetitions in strings: algorithms and combinatorics
- Linear time algorithms for finding and representing all the tandem repeats in a string
- On-line construction of suffix trees
- Extracting powers and periods in a word from its runs structure
- Algorithms on Strings
- An on-line string superprimitivity test
- How many squares can a string contain?
- An optimal algorithm to compute all the covers of a string
- Enhanced string covering
- Finding the upper envelope of n line segments in O(n log n) time
- Computing the cover array in linear time
- Optimal superprimitivity testing for strings
- Covering a string
- Title not available (Why is that?)
- Efficient detection of quasiperiodicities in strings
- Data structures and algorithms for the string statistics problem
- Title not available (Why is that?)
- Cross-document pattern matching
Cited In (15)
- String Covering: A Survey
- Efficient Computation of 2-Covers of a String.
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- On approximate enhanced covers under Hamming distance
- Approximate cover of strings
- Can we recover the cover?
- Finding the cyclic covers of a string
- String covering with optimal covers
- Experimental evaluation of algorithms for computing quasiperiods
- Subsequence covers of words
- Fast Algorithm for Partial Covers in Words
- Quasi-Periodicity in Streams
- Efficient Algorithms for Shortest Partial Seeds in Words
- Approximation and fixed parameter algorithms for the approximate cover problem
- Efficient algorithms for shortest partial seeds in words
This page was built for publication: Fast algorithm for partial covers in words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493243)
