Sort Problems Quickly Flip To The Genome Algorithm Implementation

The problem of sorting signed permutations by reversals (called SBR problem) arises from the genome rearrangements in computational molecular biology. That a segment of genes in the chromosome is reversed is called a reversal. Two genomes are denoted as two signed permutations with equal length and the same elements, the problem can be represented to find a reversal sequence with shortest size which transforms one genome into the other. A large body of research has been devoted to the SBR problem for more than ten years recently. Scientists created a series of well-designed algorithms to solve this problem;meanwhile, some of them have several implementation versions in different programming languages. After studying the most classical algorithms in the field of sorting signed permutation, this paper implements a System based on Java-Applet with graphical interface for solving the SBR problem. At the same time, the paper introduces some new trends of the SBR problem.This paper has six chapters. Chapter one describes the background research of SBR problem. Chapter two presents the theoretical groundwork for SBR. Chapter three gives a brief introduce of the algorithm and the flow chart.. Chapter four gives a presentation on the classes designed in the system , and introduces the project' s user interface and the function. Chapter five presents some primary algorithms implemented in the system. And the last chapter summarizes our experience of the results, and discusses some future amendments to the system.