Pages that link to "Item:Q834977"
From MaRDI portal
The following pages link to The greedy algorithm for shortest superstrings (Q834977):
Displaying 14 items.
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Non-uniqueness of minimal superpermutations (Q389216) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← 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)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)