Intro History Problems Applet Links References







        [1]   Hee-Kap Ahn, Prosenjit Bose,  Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, and Pat Morin.                          Flipping your lid.  Geombinatorics, X(2):57-63, 2000.

      [BP95]    Vineet Bafna and Pavel A. Pevzner. Sorting by reversals: Genome rearrangement in plant organelles and evolutionary history    of X chromosome. Mol. Biol. Evol.,12(2):235-246, 1995.

[2]   Greg Aloupis, Prosenjist Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark Overmars, Godfried T. Toussaint. Computing Signed Permutations of Polygons.

[3]    Sridhar Hannenhalli and Pavel A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc 27th Annual ACM Symposium on the Theory of Computing, pages 178-189, 1998.

[4]    Sridhar Hannenhallu and Pavel A. Pevzner. To cut or not to cut (applications of comparative physical maps in molecular evolution). In Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 304-313, 1996.

[5]    Mary E. Cosner, Robert K. Jansen, Bernard M.E. Moret, Linda A. Raubeson, Li-San Wang, Tandy Warsow, and Stacia Wyman. A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data. In Proc. 8th int'l Conf. on Itelligent Systems for Molecular Biology ISMB-200, San Diego, pages104-115, 2000.

[6] David A. Bader, Bernard M.E. Moret, and Mi Yan. A linear time algorthm for computing inversion distance between signed permutations with an experimental study. Journal of Cumputational Biology, 8(5):483-491, 2001.