Back to search

Cornell University

An Efficient Algorithm for Relationship Inference

Abstract

dc:description.abstract

Correctly inferring relatedness among samples is essential for genetic analysis. It can be helpful for preventing false signals in genetic association studies and finding relatives in forensic genetics. However, relatedness among samples is not always obtained when collecting sample data; in most cases, the relatedness is unknown and needs to be determined. Here, we develop an algorithm to infer relatedness among samples that we aim to be more efficient than current related approaches such as PLINK. Our approach is based on finding stretches of shared alleles across windows of moderate length (3-5 centiMorgans) in the genome. With this information, the algorithm infers the degree of relatedness up to the third degree from the number of windows that are similar between a pair of individuals.

Degree

thesis:*
Name thesis:degree_name
M.S., Computer Science
Level thesis:degree_level
Master of Science
Discipline thesis:degree_discipline
Computer Science
Grantor
Cornell University
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Babu, Ramya S
Chair dc:contributor.chair
  • Williams, Amy L
Committee member dc:contributor.committeemember
  • Clark, Andrew

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
10489498
Dc Identifier Other
ProQuest Submission ID: 10313
ProQuest Publication ID: 10822135

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Babu, Ramya S. An Efficient Algorithm for Relationship Inference. Master of Science thesis, Cornell University, 2018. https://hdl.handle.net/1813/59413