The fibers and range of reduction graphs in ciliates
From MaRDI portal
(Redirected from Publication:938298)
Abstract: 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.
Recommendations
- From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates
- Characterizing Reduction Graphs for Gene Assembly in Ciliates
- REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES
- Graph Polynomials Motivated by Gene Rearrangements in Ciliates
- String and graph reduction systems for gene assembly in ciliates
- Reducibility of gene patterns in ciliates using the breakpoint graph.
- Descrambling order analysis in ciliates
- Using ciliate operations to construct chromosome phylogenies
- scientific article; zbMATH DE number 2087027
- scientific article; zbMATH DE number 1948491
Cites work
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- Characterizing Reduction Graphs for Gene Assembly in Ciliates
- Computation in living cells. Gene assembly in ciliates
- Reducibility of gene patterns in ciliates using the breakpoint graph.
- Research in Computational Molecular Biology
- Strategies of loop recombination in ciliates
- Transforming cabbage into turnip
Cited in
(3)
This page was built for publication: The fibers and range of reduction graphs in ciliates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q938298)
