Searching for "Closest Substring." – sorted by Relevance.
-
On the Parameterized Intractability of Closest Substring and Related Problems
- On the Parameterized Intractability of Closest Substring and Related Problems Michael R. Fellows 1
- Cited by 10 (4 self) – Add To MetaCart
-
A polynomial time approximation scheme for the closest substring problem
- A Polynomial Time Approximation Scheme for the Closest Substring Problem Bin Ma ? University
- Cited by 14 (6 self) – Add To MetaCart
-
On the k-Closest Substring and k-Consensus Pattern Problems
- On the k-Closest Substring and k-Consensus Pattern Problems Yishan Jiao 1 ,JingyiXu 1 , and Ming
- Cited by 3 (0 self) – Add To MetaCart
-
On The Closest String and Substring Problems
- On The Closest String and Substring Problems Ming Li Department of Computer Science University
- Cited by 35 (5 self) – Add To MetaCart
-
More Efficient Algorithms for Closest String and Substring Problems
- More Efficient Algorithms for Closest String and Substring Problems Bin Ma 1 and Xiaoming Sun 2 1
- Add To MetaCart
-
Parameterized intractability of motif search problems
- Problems ∗ Michael R. Fellows † Jens Gramm ‡ Rolf Niedermeier § Abstract We show that Closest Substring
- Cited by 5 (1 self) – Add To MetaCart
-
Distinguishing string selection problems
- set of strings (Closest Substring Problem) and does not occur in another set (Farthest String Problem
- Cited by 39 (6 self) – Add To MetaCart
-
On the optimality of the dimensionality reduction method
- algorithm for the (1+ɛ)-approximate closest substring problem must run in time exponential in 1/ɛ 2−γ
- Cited by 7 (2 self) – Add To MetaCart
-
Problem and Motivation
- in s and s 0 dier. Consider the following problem: Closest substring [6] Input: A set S of strings over
- Add To MetaCart
-
Some String Problems in Computational Biology
- in one set of strings (the Closest String Problem and the Closest Substring Problem) and does not occur
- Cited by 1 (0 self) – Add To MetaCart

