Pages that link to "Item:Q4928566"

The following pages link to Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566):

Displaying 7 items.

• Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
• All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
• A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
• Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (Q2799166) (← links)
• On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
• Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
• Collapsing Superstring Conjecture (Q5875478) (← links)