Contribution to Book
Bipartite graphs have long been used to study and model matching problems, and in this paper we introduce the bipartite graphs that explain a recent matching problem in computational biology. The problem is to match haplotypes to genotypes in a way that minimizes the number of haplotypes, a problem called the Pure Parsimony problem. The goal of this work is not to address the computational or biological issues but rather to explore the mathematical structure through a study of the underlying graph theory.
Document Object Identifier (DOI)
Sergiy Butenko, W. Art Chaovalitwongse, Panos M. Pardalos
Blain, P., Davis, C., Holder, A., Silva, J. & Vinzant, C. (2009). Diversity graphs. In S. Butenko, W. A. Chaovalitwongse & P. M. Pardalos (Eds.), Clustering Challenges in Biological Networks (pp.129-151). World Scientific.
Clustering Challenges in Biological Networks