Pages that link to "Item:Q5140730"
From MaRDI portal
The following pages link to Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730):
Displaying 5 items.
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- Hierarchical overlap graph (Q2281159) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- Superstrings with multiplicities (Q5140785) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)