Pages that link to "Item:Q1329417"
From MaRDI portal
The following pages link to An optimal algorithm to compute all the covers of a string (Q1329417):
Displaying 26 items.
- Computing covers using prefix tables (Q313747) (← links)
- Enhanced string covering (Q393116) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- String covers of a tree (Q2146126) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- On approximate enhanced covers under Hamming distance (Q2295626) (← links)
- Approximate cover of strings (Q2326399) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS (Q5714671) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- String Covering: A Survey (Q6145625) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)
