V. Bafna/Pavel Pevzner: Sorting permutations by transpositions.
Proc. 6th Annual ACM-SIAM Symp. Discr. Algorithms 1995, 614-623.

V. Bafna/Pavel Pevzner: Genome rearrangements and sorting by reversals.
SIAM J. Comp. 25 (1996), ...

4394 Italo Barrai: Quest for order in DNA sequences.
Rev. Latinoamericana de Genetica 1/1 (1987), 3-9.

7213 Johanna Broecker: Zeichenkettendistanzen mit globalen Umkehroperationen.
Diplomarbeit, Freiburg i.Br. 1994.

Sridhar Hannenhalli: Polynomial-time algorithm for computing translocation
distance between genomes. ...

Sridhar Hannenhalli/Pavel Pevzner: Transforming cabbage into turnip (polynomial
algorithm for sorting signed permutations by reversals).
Proc. 27th Annual ACM Symp. Theory Comp. 1995, ...
"an excellent overview of the field of genome rearrangements.."
(8078 Vingron/).

Sridhar Hannenhalli/Pavel Pevzner: To cut ... or not to cut.
Proc. 7th Annual ACM-SIAM Symp. Discr. Algorithms 1996, 304-313.

John Kececioglu/D. Gusfield: Reconstructing a history of recombinations
from a set of sequences.
Proc. 5th Annual ACM-SIAM Symp. Discr. Algorithms 1994, 471-480.

John Kececioglu/R. Ravi: Of mice and men - evolutionary distances between
genomes under translocation.
Proc. 6th Annual ACM-SIAM Symp. Discr. Algorithms 1995, 604-613.

John Kececioglu/David Sankoff: Efficient bounds for oriented chromosome
inversion distance.
Proc. 5th Annual Symp. Comb. Pattern Matching 1994, 307-325.

John Kececioglu/David Sankoff: Exact and approximation algorithms for the
inversion distance between two permutations.
Algorithmica 13 (1995), 180-210.

11045 David Sankoff/Vincent Perretti/Joseph Nadeau: Conserved segment
identification. J. Comp. Biol. 4 (1997), 559-565.

David Sankoff a.o.: Gene order comparisons for phylogenetic inference -
evolution of the mitochondrial genome.
Proc. Nat. Ac. Sci. 89 (1992), 6575-6579.

G. Watterson/W. Ewens/T. Hall/A. Morgan: The chromosome inversion problem.
J. Theor. Biol. 99 (1982), 1-7.