Pages that link to "Item:Q5096932"
From MaRDI portal
The following pages link to A linear-time algorithm for the 1-mismatch problem (Q5096932):
Displaying 8 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
