Pages that link to "Item:Q1102756"
From MaRDI portal
The following pages link to A greedy approximation algorithm for constructing shortest common superstrings (Q1102756):
Displayed 37 items.
- On the readability of overlap digraphs (Q266924) (← links)
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← 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)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- Hierarchical overlap graph (Q2281159) (← links)
- A combinatorial approach to the design of vaccines (Q2339974) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- A linear time algorithm for shortest cyclic cover of strings (Q2628807) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- On the Readability of Overlap Digraphs (Q2942251) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← 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)
- Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- Bipartite graphs of small readability (Q5919328) (← links)