55 search results - page 1 / 11 » More Efficient Algorithms for Closest String and Substring P... |
RECOMB
2008
Springer
14 years 5 months ago
2008
Springer
SIAMCOMP
2008
13 years 4 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
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 ...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...