Optimizing Read Reversals for Sequence Compression (Q5283828): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4526966 / rank | |||
Normal rank | |||
Latest revision as of 03:56, 14 July 2024
scientific article; zbMATH DE number 6751925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimizing Read Reversals for Sequence Compression |
scientific article; zbMATH DE number 6751925 |
Statements
Optimizing Read Reversals for Sequence Compression (English)
0 references
25 July 2017
0 references
sequence compression
0 references
2-factor approximation
0 references
