Pages that link to "Item:Q1698721"
From MaRDI portal
The following pages link to Efficient algorithms for shortest partial seeds in words (Q1698721):
Displaying 13 items.
- Fast algorithm for partial covers in words (Q493243) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Approximate cover of strings (Q2326399) (← links)
- On the appearance of seeds in words (Q2809942) (← links)
- Fast Algorithm for Partial Covers in Words (Q4928571) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Efficient Algorithms for Shortest Partial Seeds in Words (Q5165605) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Property Suffix Array with Applications in Indexing Weighted Sequences (Q6039923) (← links)
- String Covering: A Survey (Q6145625) (← links)
- Subsequence covers of words (Q6166966) (← links)