Pages that link to "Item:Q5492909"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492909):
Displayed 14 items.
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← 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)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Applying Small-Scale DNA Signatures as an Aid in Assembling Soybean Chromosome Sequences (Q3002750) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← 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)