Pages that link to "Item:Q4310837"
From MaRDI portal
The following pages link to Linear approximation of shortest superstrings (Q4310837):
Displayed 19 items.
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Diagram processing: Computing with diagrams (Q814449) (← links)
- The greedy algorithm for shortest superstrings (Q834977) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Faster implementation of a shortest superstring approximation (Q1336759) (← links)
- Inferring a tree from walks (Q1351963) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Physical mapping of chromosomes: A combinatorial problem in molecular biology (Q1902467) (← links)
- Optimal solutions in the multi-location inventory system with transshipments (Q2369962) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Fast prefix matching of bounded strings (Q5463440) (← links)
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM (Q5714670) (← links)