The biological process of gene assembly has been modeled based on three types of string rewriting rules, called string pointer rules, defined on so-called legal strings. It has been shown that reduction graphs, graphs that are based on the notion of breakpoint graph in the theory of sorting by reversal, for legal strings provide valuable insights into the gene assembly process. We characterize which legal strings obtain the same reduction graph (up to isomorphism), and moreover we characterize which graphs are (isomorphic to) reduction graphs. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Brijder, R., & Hoogeboom, H. J. (2007). Characterizing reduction graphs for gene assembly in ciliates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 120–131). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_14
Mendeley helps you to discover research relevant for your work.