The approximability of the String Barcoding problem
<p>Abstract</p> <p>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 members of a set of given strings. In a computational biology context, the given string...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2006-08-01
|
| Series: | Algorithms for Molecular Biology |
| Online Access: | http://www.almob.org/content/1/1/12 |