Pages that link to "Item:Q1209376"
From MaRDI portal
The following pages link to An on-line string superprimitivity test (Q1209376):
Displaying 46 items.
- Computing covers using prefix tables (Q313747) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← 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)
- 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)
- An extension of the periodicity lemma to longer periods (Q1764895) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Covering a string (Q1924404) (← 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)
- Universal reconstruction of a string (Q2297860) (← links)
- Approximate cover of strings (Q2326399) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Computing the \(\lambda \)-covers of a string (Q2384518) (← links)
- Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618) (← links)
- Can we recover the cover? (Q2415365) (← links)
- INFERRING STRINGS FROM COVER ARRAYS (Q2846478) (← 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)
- Computing runs on a trie (Q5088914) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- Generalized approximate regularities in strings (Q5451457) (← 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)
- Approximate periods of strings (Q5958136) (← links)
- String Covering: A Survey (Q6145625) (← links)
