1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15815
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBlazewicz, Jaceken_UK
dc.contributor.authorBurke, Edmunden_UK
dc.contributor.authorKasprzak, Martaen_UK
dc.contributor.authorKovalev, Alexandren_UK
dc.contributor.authorKovalyov, Mikhail Yen_UK
dc.date.accessioned2018-02-15T01:05:37Z-
dc.date.available2018-02-15T01:05:37Zen_UK
dc.date.issued2009-10en_UK
dc.identifier.urihttp://hdl.handle.net/1893/15815-
dc.description.abstractIn 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.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationBlazewicz 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.017en_UK
dc.rightsThe 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.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.subjectGenome mappingen_UK
dc.subjectSimplified Partial Digesten_UK
dc.subjectComputational complexityen_UK
dc.subjectApproximationen_UK
dc.titleOn the approximability of the Simplified Partial Digest Problemen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate3000-01-01en_UK
dc.rights.embargoreason[On the approximability of the Simplified Partial Digest Problem.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1016/j.dam.2009.04.017en_UK
dc.citation.jtitleDiscrete Applied Mathematicsen_UK
dc.citation.issn0166-218Xen_UK
dc.citation.volume157en_UK
dc.citation.issue17en_UK
dc.citation.spage3586en_UK
dc.citation.epage3592en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.author.emaile.k.burke@stir.ac.uken_UK
dc.contributor.affiliationPoznan University of Technologyen_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.contributor.affiliationPoznan University of Technologyen_UK
dc.contributor.affiliationPoznan University of Technologyen_UK
dc.contributor.affiliationNational Academy of Sciences of Belarusen_UK
dc.identifier.isiWOS:000271931600010en_UK
dc.identifier.scopusid2-s2.0-70350062581en_UK
dc.identifier.wtid694116en_UK
dcterms.dateAccepted2009-10-31en_UK
dc.date.filedepositdate2013-07-08en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorBlazewicz, Jacek|en_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.authorKasprzak, Marta|en_UK
local.rioxx.authorKovalev, Alexandr|en_UK
local.rioxx.authorKovalyov, Mikhail Y|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate3000-01-01en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameOn the approximability of the Simplified Partial Digest Problem.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0166-218Xen_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
On the approximability of the Simplified Partial Digest Problem.pdfFulltext - Published Version945.29 kBAdobe PDFUnder Embargo until 3000-01-01    Request a copy


This item is protected by original copyright

View License
Show simple item record


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.