Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
418957 | Discrete Applied Mathematics | 2008 | 18 Pages |
Abstract
The concept of breakpoint graph, known from the theory of sorting by reversal, has been successfully applied in the theory of gene assembly in ciliates. We further investigate its usage for gene assembly, and show that the graph allows for an efficient characterization of the possible orders of loop recombination operations (one of the three types of molecular operations that accomplish gene assembly) for a given gene during gene assembly. The characterization is based on spanning trees within a graph built upon the connected components in the breakpoint graph. We work in the abstract and more general setting of so-called legal strings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus,