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）中，配对重排问题在多项式时间图灵归约下是#P完备的。其次，在单次剪切或连接模型（Feijao & Meidanis, IEEE ACM Trans. Comp. Biol. Bioinf. 2011）中，我们证明了枚举所有中位数（#Median）问题是对数空间可计算的（FL），改进了Miklós & Smith（RECOMB 2015）此前给出的多项式时间（FP）界。