Pages that link to "Item:Q1822981"

The following pages link to Approximation algorithms for the shortest common superstring problem (Q1822981):

Displaying 34 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)
• The constrained shortest common supersequence problem (Q396654) (← links)
• Reoptimization of the shortest common superstring problem (Q639296) (← 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)
• Why greed works for shortest common superstring problem (Q1038476) (← links)
• On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← links)
• An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
• A note on shortest superstrings with flipping (Q1208439) (← links)
• A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
• More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
• Approximating shortest superstrings with constraints (Q1341729) (← links)
• An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← 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)
• Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
• A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
• (Q3409986) (← links)
• DNA sequencing and string learning (Q3445271) (← links)
• Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
• Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256) (← links)
• Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487) (← links)
• NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
• (Q4858904) (← links)
• Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
• \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← 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)
• Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM (Q5714670) (← links)
• Collapsing Superstring Conjecture (Q5875478) (← links)