String and graph reduction systems for gene assembly in ciliates
From MaRDI portal
Recommendations
Cited in
(18)- Gene assembly through cyclic graph decomposition
- Formal systems for gene assembly in ciliates.
- Nullity invariance for pivot and the interlace polynomial
- Extending the Overlap Graph for Gene Assembly in Ciliates
- Simple Operations for Gene Assembly
- REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES
- Graph reductions, binary rank, and pivots in gene assembly
- Graph Polynomials Motivated by Gene Rearrangements in Ciliates
- A String-Based Model for Simple Gene Assembly
- Theory Inspired by Gene Assembly in Ciliates
- Maximal pivots on graphs with an application to gene assembly
- Pivots, determinants, and perfect matchings of graphs
- Extended strings and graphs for simple gene assembly
- Combining overlap and containment for gene assembly in ciliates
- Recombination faults in gene assembly in ciliates modeled using multimatroids
- The fibers and range of reduction graphs in ciliates
- Solutions to computational problems through gene assembly
- Strategies of loop recombination in ciliates
This page was built for publication: String and graph reduction systems for gene assembly in ciliates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146247)