Title
Document Type
Contribution to Book
Publication Date
2009
Abstract
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.
Editor
Sergiy Butenko, W. Art Chaovalitwongse, Panos M. Pardalos
Identifier
10.1142/9789812771667_0006
Publisher
World Scientific
City
Singapore
ISBN
9789812771650
Repository Citation
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.
Publication Information
Clustering Challenges in Biological Networks