id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_xx4dy6wva5eyteyadw75sopnka	Richa Agarwala	Software for Constructing and Verifying Pedigrees within Large Genealogies and an Application to the Old Order Amish of Lancaster County	1998.0	12	.pdf	application/pdf	7523	686	66	A frequent problem in medical genetics is to connect distant relatives with a pedigree. PedHunter uses methods from graph theory to solve two versions of the pedigree connection problem for PedHunter uses a relational database of genealogy data, with tables software tools, called PedHunter, to keep genealogical data in a relational database and to analyze the Each record in the Fisher book contains the following pieces of information relevant to genealogies: of people S, then for each lowest common ancestor a, asp(S) finds the pedigree containing all edges on the path are consistent with the information in the database. shortest paths pedigree (ASPped) for the least common ancestor that has the maximum number of A directed path p from u to v in a pedigree graph A pedigree graph G connects a set of individuals Any directed pedigree graph is acyclic, as the edges	./cache/work_xx4dy6wva5eyteyadw75sopnka.pdf	./txt/work_xx4dy6wva5eyteyadw75sopnka.txt