Pages that link to "Item:Q688155"
From MaRDI portal
The following pages link to Efficient detection of quasiperiodicities in strings (Q688155):
Displaying 45 items.
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- The subsequence composition of a string (Q732027) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Quasiperiodic Sturmian words and morphisms (Q870835) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- An on-line string superprimitivity test (Q1209376) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Covering a string (Q1924404) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- On approximate enhanced covers under Hamming distance (Q2295626) (← links)
- Quasiperiods of biinfinite words (Q2297910) (← links)
- Approximate cover of strings (Q2326399) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Coverability and multi-scale coverability on infinite pictures (Q2424689) (← links)
- Collage of two-dimensional words (Q2484446) (← links)
- Coverability in Two Dimensions (Q2799191) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Episturmian words: a survey (Q5321774) (← 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)
- String Covering: A Survey (Q6145625) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)
- String covers of a tree revisited (Q6545440) (← links)
