Graph reductions, binary rank, and pivots in gene assembly

DOI10.1016/j.dam.2011.07.007zbMath1237.05181arXiv1103.4334MaRDI 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 rank; gene assembly; graph reductions; path invariance; pivots

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

92D10: Genetics and epigenetics

05C76: Graph operations (line graphs, products, etc.)

Related Items

Pivots, determinants, and perfect matchings of graphs

Cites Work

• 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
• Unnamed Item