The simplified partial digest problem: Approximation and a graph-theoretic model |
| |
Authors: | Jacek Blazewicz Edmund K Burke Marta Kasprzak Alexandr Kovalev Mikhail Y Kovalyov |
| |
Institution: | 1. Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznan, Poland;2. Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12, 61-704 Poznan, Poland;3. School of Computer Science, University of Nottingham, Jubilee Campus, Nottingham NG8 1BB, UK;4. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus |
| |
Abstract: | The goal of the simplified partial digest problem (SPDP) is motivated by the reconstruction of the linear structure of a DNA chain with respect to a given nucleotide pattern, based on the multiset of distances between the adjacent patterns (interpoint distances) and the multiset of distances between each pattern and the two unlabeled endpoints of the DNA chain (end distances). We consider optimization versions of the problem, called SPDP-Min and SPDP-Max. The aim of SPDP-Min (SPDP-Max) is to find a DNA linear structure with the same multiset of end distances and the minimum (maximum) number of incorrect (correct) interpoint distances. Results are presented on the worst-case efficiency of approximation algorithms for these problems. We suggest a graph-theoretic model for SPDP-Min and SPDP-Max, which can be used to reduce the search space for an optimal solution in either of these problems. We also present heuristic polynomial time algorithms based on this model. In computational experiments with randomly generated and real-life input data, our best algorithm delivered an optimal solution in 100% of the instances for a number of restriction sites not greater than 50. |
| |
Keywords: | Integer programming Genome mapping Combinatorial optimization Heuristics Approximation algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|