Sciweavers

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

74

Voted

RECOMB
2008
Springer

favoriteEmaildiscussreport

221views Computational Biology» more RECOMB 2008»

More Efficient Algorithms for Closest String and Substring Problems

15 years 11 months ago

More Efficient Algorithms for Closest String and Substring Problems

Download itcs.tsinghua.edu.cn

Bin Ma, Xiaoming Sun

Real-time Traffic

Computational Biology | Efficient Algorithms | RECOMB 2008 |

claim paper

Related Content

» Closest Substring Problems with Small Distances

» Complexity of Approximating Closest Substring Problems

» On The Closest String and Substring Problems

» The Closest Substring problem with small distances

» An Efficient Algorithm for Identifying the Most Contributory Substring

» Parameterized Intractability of Distinguishing Substring Selection

» Why Large Closest String Instances Are Easy to Solve in Practice

» Fast algorithms for computing sequence distances by exhaustive substring composition

» Efficient string matching with wildcards and length constraints

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2008
Where	RECOMB
Authors	Bin Ma, Xiaoming Sun

Comments (0)