Sciweavers

RECOMB
2008
Springer

More Efficient Algorithms for Closest String and Substring Problems

14 years 12 months ago
More Efficient Algorithms for Closest String and Substring Problems
Bin Ma, Xiaoming Sun
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2008
Where RECOMB
Authors Bin Ma, Xiaoming Sun
Comments (0)