Pages that link to "Item:Q903196"
From MaRDI portal
The following pages link to On the greedy algorithm for the shortest common superstring problem with reversals (Q903196):
Displaying 10 items.
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256) (← links)
- Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487) (← links)
- Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
- Superstrings with multiplicities (Q5140785) (← links)