Sciweavers

Share
SSDBM
2007
IEEE

Efficient Evaluation of Inbreeding Queries on Pedigree Data

10 years 1 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree graph structures. Inbreeding is the quantitative measure of the genetic relationship between two individuals. The inbreeding coefficient is related to the probability that both copies of any given gene are received from the same ancestor. In this paper we discuss the evaluation of the inbreeding coefficient of a given individual using NodeCodes. We implemented and tested our approach with both synthetic and real pedigree data. Experimental results show that the use of NodeCodes provides a good alternative for queries involving the inbreeding coefficient, with significant improvements over the traditional iterative evaluation methods.
Brendan Elliott, Suleyman Fatih Akgul, Stephen May
Added 04 Jun 2010
Updated 04 Jun 2010
Type Conference
Year 2007
Where SSDBM
Authors Brendan Elliott, Suleyman Fatih Akgul, Stephen Mayes, Z. Meral Özsoyoglu
Comments (0)
books