Pages that link to "Item:Q1318749"
From MaRDI portal
The following pages link to Testing string superprimitivity in parallel (Q1318749):
Displaying 14 items.
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Approximate cover of strings (Q2326399) (← links)
- Can we recover the cover? (Q2415365) (← 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)
- Approximate periods of strings (Q5958136) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)
