Pages that link to "Item:Q3575256"

The following pages link to Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256):

Displaying 13 items.

• On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
• Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
• On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← links)
• More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
• Approximation algorithms for the shortest common superstring problem (Q1822981) (← 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 linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
• On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
• Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487) (← links)
• Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
• Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
• Superstrings with multiplicities (Q5140785) (← links)