Pages that link to "Item:Q1140992"
From MaRDI portal
The following pages link to On finding minimal length superstrings (Q1140992):
Displaying 11 items.
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← 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)
- Inferring a tree from walks (Q5096851) (← links)
- Settlement Fund Circulation Problem (Q5136266) (← links)
- Superstrings with multiplicities (Q5140785) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- String editing under pattern constraints (Q6646447) (← links)