{"title":"Complexity and enumeration in models of genome rearrangement","authors":"","doi":"10.1016/j.tcs.2024.114880","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the <span>Pairwise Rearrangement</span> problem in the Single Cut-and-Join model (Bergeron et al., 2010 <span><span>[8]</span></span>) is <span><math><mi>#</mi><mtext>P</mtext></math></span>-complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijão and Meidanis, 2011 <span><span>[21]</span></span>), the problem of enumerating all medians (<figure><img></figure>) is logspace-computable (<span><math><mtext>FL</mtext></math></span>), improving upon the previous polynomial-time (<span><math><mtext>FP</mtext></math></span>) bound of Miklós & Smith <span><span>[41]</span></span>.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524004973","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron et al., 2010 [8]) is -complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijão and Meidanis, 2011 [21]), the problem of enumerating all medians () is logspace-computable (), improving upon the previous polynomial-time () bound of Miklós & Smith [41].
期刊介绍：
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
