Next:
Genome Rearrangements
10 December 25, 2000 Ron Shamir and Itsik Pe'er Yaniv Nahum and Sonny Ben-Shimon
Genome Rearrangements
Preface
Operations on Chromosomes
Why Study Genome Rearrangements?
Unsigned Permutations
Examples of Genome Rearrangements
An Algorithm for Sorting Signed Permutations
Introduction
Group Theory Viewpoint
Definitions
The Breakpoint Graph
The Overlap Graph
Hurdles
A New Proof
Happy Cliques
Implicit Representation of the Overlap Graph
Finding a Happy Clique
Computing the Unoriented Degrees
Algorithm Summary
Open Problems
Bibliography
About this document ...
Peer Itsik
2001-01-17
