Family relationships in the form of pedigree graphs are currently collected from genealogical records in an expensive process of determining which pairs of people are parent and child. With the end goal of reconstructing pedigrees, this paper considers how to compare two pedigree graphs for accuracy.
This paper reminds the reader of an alternative formulation of pedigree relationships, published earlier, that describes a pedigree as a list of descendant individuals, rather than parent-child relationships. This formulation is useful for comparing two similar pedigree graphs via a randomized algorithm that estimates the minimum number of edge changes that are necessary to change one pedigree into the other. This randomized algorithm runs in polynomial time.
Title
Algorithms for Comparing Pedigree Graphs
Published
2010-05-31
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2010-89
Type
Text
Extent
18 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
