STORRE
STORRE: Stirling Online Research Repository
http://hdl.handle.net/1893/15815| Appears in Collections: | Computing Science and Mathematics Journal Articles |
| Peer Review Status: | Refereed |
| Title: | On the approximability of the Simplified Partial Digest Problem |
| Author(s): | Blazewicz, Jacek Burke, Edmund Kasprzak, Marta Kovalev, Alexandr Kovalyov, Mikhail Y |
| Contact Email: | e.k.burke@stir.ac.uk |
| Keywords: | Genome mapping Simplified Partial Digest Computational complexity Approximation |
| Issue Date: | Oct-2009 |
| Date Deposited: | 8-Jul-2013 |
| Citation: | Blazewicz J, Burke E, Kasprzak M, Kovalev A & Kovalyov MY (2009) On the approximability of the Simplified Partial Digest Problem. Discrete Applied Mathematics, 157 (17), pp. 3586-3592. https://doi.org/10.1016/j.dam.2009.04.017 |
| Abstract: | In this paper, we analyse the computational complexity of an optimization version of the Simplified Partial Digest Problem (SPDP), which is a mathematical model for DNA mapping based on the results of a simplified partial digest experiment. We prove that recognizing 46.16% of the elements of the DNA map in the error-free simplified partial digest experiment is NP-hard in the strong sense. This implies that the problem of maximizing the number of correct elements of the DNA map in the error-free simplified partial digest experiment is pseudopolynomially non-approximable with the approximation ratio ρ=13/6. |
| DOI Link: | 10.1016/j.dam.2009.04.017 |
| Rights: | The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. |
| Licence URL(s): | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved |
| File | Description | Size | Format | |
|---|---|---|---|---|
| On the approximability of the Simplified Partial Digest Problem.pdf | Fulltext - Published Version | 945.29 kB | Adobe PDF | Under Embargo until 3000-01-01 Request a copy |
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright |
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.