Testing string superprimitivity in parallel
From MaRDI portal
Recommendations
- Optimal superprimitivity testing for strings
- An on-line string superprimitivity test
- Efficient parallel algorithms to test square-freeness and factorize strings
- Efficient parallel string comparison
- Parallel and sequential approximation of shortest superstrings
- scientific article; zbMATH DE number 4205980
- Optimal parallel detection of squares in strings
- Sequential and Parallel Approximation of Shortest Superstrings
- On testing consecutive-ones property in parallel
- A Lower Bound for Parallel String Matching
Cites work
- A Lower Bound for Parallel String Matching
- An on-line string superprimitivity test
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Covering a string
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient detection of quasiperiodicities in strings
- Fast parallel string prefix-matching
- Finding all periods and initial palindromes of a string in parallel
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- Optimal superprimitivity testing for strings
- Recursive Star-Tree Parallel Data Structure
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(17)- An on-line string superprimitivity test
- Quasiperiodicity and string covering
- Normal forms of quasiperiodic strings
- Finding all periods and initial palindromes of a string in parallel
- Experimental evaluation of algorithms for computing quasiperiods
- Approximate cover of strings
- Can we recover the cover?
- Quasi-periodicity under mismatch errors
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- Efficient Computation of 2-Covers of a String.
- Approximate periods of strings
- Approximation and fixed parameter algorithms for the approximate cover problem
- A work-time optimal algorithm for computing all string covers
- Fast parallel string prefix-matching
- Internal quasiperiod queries
- Optimal superprimitivity testing for strings
- Optimality of some algorithms to detect quasiperiodicities
This page was built for publication: Testing string superprimitivity in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318749)
