The phrase "an exacting program" is correct and usable in written English.
You can use it to describe a program that is demanding or requires a high level of effort and precision.
Example: "The training course is an exacting program that challenges even the most experienced participants."
Alternatives: "a rigorous program" or "a demanding program".
After mathematically defining the underlying quality planning model, we propose an exact Dynamic Programming approach for determining optimal programs.
In order to solve large-sized instances of the problem, an exact dynamic programming approach based on optimal assignments between coils and positions in a bipartite network with cuts is designed by exploiting the problem structure.
Specifically, we identify indels that can only be parsimoniously explained by lineage-specific insertion or deletion events, using an exact dynamic-programming algorithm (see Materials and Methods).
Based on the above equations, we can construct an exact dynamic programming algorithm for BOP.
In this section we present an exact dynamic programming algorithm for (RKP).
In this subsection, we shall describe an exact dynamic programming algorithm for solving the SNP - M S P problem.
There is also an exact dynamic programming solution to the sih problem; its running time is exponential in the length of the longest read (He et al., 2010).
We present an exact dynamic programming algorithm for solving the SNP - M S P problem and also show that the SNP - M S Q problem is NP-hard by a reduction from a restricted variation of the 3-partition problem.
In the Additional file 1, we show that both SNP - M S P and SNP - M S Q are theoretically NP-hard, together with an exact dynamic programming algorithm for solving the SNP - M S P problem.
Then, we present an exact dynamic programming algorithm for solving the SNP - M S P problem and also show that the SNP - M S Q problem is NP-hard by a reduction from the restricted variation of the 3-partition problem [ 7, 8].
