CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007 vol.4 Issue No.04 - October-December

Subscribe

Issue No.04 - October-December (2007 vol.4)

pp: 668-680

ABSTRACT

We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2^n)$ time enumerative algorithm and an $O(n^{2q})$ time dynamic programming algorithm for the error-free SPDP, where $n$ is the number of restriction sites and $q$ is the number of distinct intersite distances. We also give examples of the problem, in which there are $2^{\frac{n+2}{3}-1}$ non-congruent solutions. These examples partially answer a question recently posed in the literature about the number of solutions of SPDP. We adapt our enumerative algorithm for handling SPDP with imprecise input data. Finally, we describe and discuss the results of the computer experiments with our algorithms.

INDEX TERMS

Algorithm design and analysis, Dynamic programming, genome mapping, restriction site analysis, imprecise information

CITATION

Jacek Blazewicz, Edmund Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Kovalyov, "Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.4, no. 4, pp. 668-680, October-December 2007, doi:10.1109/TCBB.2007.1060