Pages that link to "Item:Q313766"
From MaRDI portal
The following pages link to The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766):
Displayed 4 items.
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- Superstrings with multiplicities (Q5140785) (← links)