Graph reductions, binary rank, and pivots in gene assembly

DOI10.1016/j.dam.2011.07.007zbMath1237.05181arXiv1103.4334OpenAlexW1964768783MaRDI QIDQ411856

Nathan Pflueger

Publication date: 30 April 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.4334

zbMATH Keywords

binary rankgene assemblygraph reductionspath invariancepivots

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Genetics and epigenetics (92D10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Pivots, determinants, and perfect matchings of graphs

Cites Work

• Unnamed Item
• Three models for gene assembly in ciliates: a comparison
• Characterizing the micronuclear gene patterns in ciliates
• The interlace polynomial of a graph
• Pivots, determinants, and perfect matchings of graphs
• Parallel complexity of signed graphs for gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly
• Graph theoretic approach to parallel gene assembly
• The parallel complexity of signed graphs: Decidability results and an improved algorithm
• A generalization of Tutte's characterization of totally unimodular matrices
• Computation in living cells. Gene assembly in ciliates
• Chromatic number and the 2-rank of a graph
• Formal systems for gene assembly in ciliates.
• Rank-width and vertex-minors
• String and graph reduction systems for gene assembly in ciliates
• DNA Computing

This page was built for publication: Graph reductions, binary rank, and pivots in gene assembly