Pages that link to "Item:Q5714671"
From MaRDI portal
The following pages link to ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS (Q5714671):
Displaying 7 items.
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Inferring strings from cover arrays (Q2846478) (← links)
- Algorithms on strings. Translated from the 2001 French original (Q2925476) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
- Fast Algorithm for Partial Covers in Words (Q4928571) (← links)
- String Covering: A Survey (Q6145625) (← links)