Answers are grounded in this paper and cite their sources.
Motivation: Finding genomic distance based on gene order is a classic problem in genome rearrangements. Efficient exact algorithms for genomic distances based on inversions and/or translocations have been found but are complicated by special cases, rare in simulations and empirical data. We seek a universal operation underlying a more inclusive set of evolutionary operations and yielding a tractable genomic distance with simple mathematical form.
No takes yet. Share an insight, caveat, or question.
Yancopoulos et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: