Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

IPL
2016

favoriteEmaildiscussreport

54views more IPL 2016»

On the greedy algorithm for the Shortest Common Superstring problem with reversals

8 years 15 days ago

On the greedy algorithm for the Shortest Common Superstring problem with reversals

Download math.unipa.it

Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski

Real-time Traffic

IPL 2016 |

claim paper

Related Content

» Conditional Inequalities and the Shortest Common Superstring Problem

» Algorithms for Three Versions of the Shortest Common Superstring Problem

» A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem

» String Noninclusion Optimization Problems

» Perfect Sorting by Reversals Is Not Always Difficult

» Hedging Uncertainty Approximation Algorithms for Stochastic Optimization Problems

» Optimizing Monitoring Queries over Distributed Data

Post Info
More Details (n/a)

Added	05 Apr 2016
Updated	05 Apr 2016
Type	Journal
Year	2016
Where	IPL
Authors	Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Comments (0)