Pages that link to "Item:Q4310837"

The following pages link to Linear approximation of shortest superstrings (Q4310837):

Displaying 48 items.

• The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
• A probabilistic PTAS for shortest common superstring (Q393897) (← links)
• Recognition of overlap graphs (Q405660) (← links)
• Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
• Combined super-/substring and super-/subsequence problems (Q596093) (← links)
• Diagram processing: Computing with diagrams (Q814449) (← links)
• The greedy algorithm for shortest superstrings (Q834977) (← links)
• On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
• A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← 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 note on shortest superstrings with flipping (Q1208439) (← links)
• A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
• Faster implementation of a shortest superstring approximation (Q1336759) (← links)
• Approximating shortest superstrings with constraints (Q1341729) (← links)
• Inferring a tree from walks (Q1351963) (← links)
• Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458) (← links)
• Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
• Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
• Physical mapping of chromosomes: A combinatorial problem in molecular biology (Q1902467) (← links)
• All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
• Hierarchical overlap graph (Q2281159) (← links)
• A combinatorial approach to the design of vaccines (Q2339974) (← links)
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
• An external-memory algorithm for string graph construction (Q2362353) (← 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 linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
• On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
• Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
• Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← 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)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• (Q4997780) (← links)
• Parallel and sequential approximation of shortest superstrings (Q5056169) (← links)
• Improved length bounds for the shortest superstring problem (Q5057460) (← links)
• Approximating shortest superstrings with constraints (Q5060130) (← links)
• On the approximability of the maximum common subgraph problem (Q5096796) (← links)
• Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
• Superstrings with multiplicities (Q5140785) (← links)
• Fast prefix matching of bounded strings (Q5463440) (← links)
• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM (Q5714670) (← links)
• Collapsing Superstring Conjecture (Q5875478) (← links)
• String editing under pattern constraints (Q6646447) (← links)