Biology Reference
In-Depth Information
Chapter 6
Diversity Graphs
P. B l a i n
Swarthmore College Mathematics, Swarthmore, PA, USA
pblain1@swarthmore.edu
C. Davis
University of Utah Mathematics, Salt Lake, UT, USA
davis@math.utah.edu
A. Holder
Rose-Hulman Institute of Technology, Mathematics, Terre Haute, IN, USA
aholder@rose-hulman.edu
∗
J. Silva
University of Colorado Applied Mathematics, Denver, CO, USA
jsilva2105@msn.com
C. Vinzant
Oberlin College Mathematics, Oberlin, OH, USA
cvinzant@oberlin.edu
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 match-
ing 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 com-
putational or biological issues but rather to explore the mathematical structure
through a study of the underlying graph theory.
∗
Research conducted at Trinity University, San Antonio, TX, with partial support of the National
Science Foundation, grant DMS-0353488.
129
Search WWH ::
Custom Search