Randomized algorithms
Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for the Hamming center problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Algorithms for Computing Characteristic Strings
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Banishing Bias from Consensus Sequences
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A Polynominal Time Approximation Scheme for the Closest Substring Problem
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Complexities of the centre and median string problems
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
RNA multiple structural alignment with longest common subsequences
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Consider two sets of strings, B (bad genes) and G (good genes), as well as two integers db and dg (db 驴 dg). A frequently occurring problem in computational biology (andother fields) is to finda (distinguishing) substring s of length L that distinguishes the bad strings from goodstrings, i.e., for each string si 驴 B there exists a length-L substring ti of si with d(s, ti) 驴 db (close to badstrings) andfor every substring ui of length L of every string gi 驴 G, d(s, ui) 驴 dg (far from goodstrings). We present a polynomial time approximation scheme to settle the problem, i.e., for any constant 驴 0, the algorithm finds a string s of length L such that for every si 驴 B, there is a length-L substring ti of si with d(ti, s) 驴 (1+驴)db and for every substring ui of length L of every gi 驴 G, d(ui, s) 驴 (1 - 驴)dg, if a solution to the original pair (db 驴 dg) exists.