Pages that link to "Item:Q313747"
From MaRDI portal
The following pages link to Computing covers using prefix tables (Q313747):
Displaying 7 items.
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← 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)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
