随机相邻转置序列后的期望反转数
Expected number of inversions after a sequence of random adjacent transpositions
摘要：
在基因组的进化中，基因序列有时会重排，例如通过两个相邻基因块的转座。在生物组合学中，人们试图从产生的排列中重建这些重排事件。看来，使用的算法是太有效，并找到一个比真正的更短的路径。对于相邻换位的简化情况，我们给出了t随机移动后期望的反转数的表达式。这个平均值可能比t小小于得多，这个事实到目前为止在很大程度上被忽视了。
英文摘要：
In the evolution of a genome, the gene sequence is sometimes rearranged, for example by transposition of two adjacent gene blocks. In biocombinatorics, one tries to reconstruct these rearrangement incidents from the resulting permutation. It seems that the algorithms used are too effective and find a shorter path than the real one. For the simplified case of adjacent transpositions, we give expressions for the expected number of inversions after t random moves. This average can be much smaller than t, a fact that has largely been neglected so far.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
