122 search results - page 1 / 25 » The approximability of the String Barcoding problem |
ALMOB
2006
13 years 4 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...
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
RECOMB
2002
Springer
14 years 4 months ago
2002
Springer
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...