Pages that link to "Item:Q719265"
From MaRDI portal
The following pages link to Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265):
Displaying 7 items.
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- (Q5005095) (← links)
- (Q5111743) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
