201 search results - page 1 / 41 » The Minimum Substring Cover Problem |
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
ALMOB
2006
13 years 5 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
FCT
2003
Springer
13 years 10 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
IPL
2011
13 years 8 days ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...