In this paper we propose new algorithms for these two problems. For the closest string problem, we developed an exact algorithm with time complexity.
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design.
People also ask
Can you solve the Closest String faster than exhaustive search?
What is the Closest String problem?
What is the Closest String and substring problem?
Given n length-m strings s1, s2, ..., sn, and a radius d, the closest string problem seeks for a new length-m string s such that d(s, si) ≤ d. Here d(·, ·) is ...
Jul 18, 2016 · The Closest String problem (CSP) is a combinatorial optimization problem that receives as input a set of strings of the same length and seeks a ...
Missing: More | Show results with:More
In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input ...
May 26, 2023 · In this paper, we investigate whether the Closest String problem admits algorithms that are faster than the trivial exhaustive search algorithm.
Missing: Efficient | Show results with:Efficient
More Efficient Algorithms for Closest String and Substring Problems
link.springer.com › content › pdf
Abstract. The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design.
Sep 27, 2019 · The closest string problem (CSP for short) asks for a string that is within a Hamming distance of d to each of the given strings.
The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory.
In this paper, we study the closest string problem. This problem has applications in universal PCR primer design, genetic probes design, motif finding, ...