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, Medvedev, & Stoye, J. Comput. Biol. 2010) is $\#\textsf{P}$-complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijao & Meidanis, IEEE ACM Trans. Comp. Biol. Bioinf. 2011), the problem of enumerating all medians ($\#$Median) is logspace-computable ($\textsf{FL}$), improving upon the previous polynomial-time ($\textsf{FP}$) bound of Mikl\'os & Smith (RECOMB 2015).

翻译：本文研究了若干基因组重排模型中枚举问题的计算复杂性。我们首先证明，在单切割连接模型（Bergeron, Medvedev & Stoye, J. Comput. Biol. 2010）中的成对重排问题在多项式时间图灵归约下是 $\#\textsf{P}$-完全的。其次，我们证明在单切割或连接模型（Feijao & Meidanis, IEEE ACM Trans. Comp. Biol. Bioinf. 2011）中，枚举所有中值基因组的问题（$\#$Median）是对数空间可计算的（$\textsf{FL}$），这改进了 Miklós & Smith（RECOMB 2015）先前给出的多项式时间（$\textsf{FP}$）上界。