78 search results - page 7 / 16 » On The Closest String and Substring Problems |
RECOMB
2002
Springer
15 years 9 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...
JUCS
2010
14 years 8 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
66
Voted
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
85
Voted
ACL
2012
12 years 12 months ago
2012
In this paper, we demonstrate that accurate machine translation is possible without the concept of “words,” treating MT as a problem of transformation between character string...
65
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...