Pages that link to "Item:Q5900798"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900798):
Displaying 10 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- The minimum substring cover problem (Q958306) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- Alphabet indexing for approximating features of symbols (Q1274598) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- Complexity of substring search in a set of strings (Q1791617) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
- Fundamentals of Computation Theory (Q5900797) (← links)