{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/59413"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/59413","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"An Efficient Algorithm for Relationship Inference","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Babu, Ramya S"],"institution":"Cornell University","degree_name":"M.S., Computer Science","degree_level":"Master of Science","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Williams, Amy L"],"committee_members":["Clark, Andrew"],"year":2018,"date_issued":"2018-05-30","date_published":"2018-05-30","updated_at":"2026-11-19T03:20:08Z","subjects":["Genetics","Efficient","Relatedness Inference","Computer science"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/X4RN363M"],"render_values":[{"text":"https://doi.org/10.7298/X4RN363M","href":"https://doi.org/10.7298/X4RN363M","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10489498"],"render_values":[{"text":"10489498","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 10313","ProQuest Publication ID: 10822135"],"render_values":[{"text":"ProQuest Submission ID: 10313","href":null,"code":true},{"text":"ProQuest Publication ID: 10822135","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/59413","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/59413","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F59413","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Williams, Amy L"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Clark, Andrew"]},{"key":"dc:creator","label":"Author","values":["Babu, Ramya S"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-10-23T13:22:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-10-23T13:22:40Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-05-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master of Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S., Computer Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Genetics","Efficient","Relatedness Inference","Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10489498"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/X4RN363M"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 10313","ProQuest Publication ID: 10822135"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/59413"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"cabff802-0879-4196-9be6-5018397cc10f\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>An Efficient Algorithm for Relationship Inference</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-05-30</PublicationDate> <DOI>https://doi.org/10.7298/X4RN363M</DOI> <Authors> <Author> <DisplayName>Babu, Ramya S</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Genetics</Keyword> <Keyword>Efficient</Keyword> <Keyword>Relatedness Inference</Keyword> <Keyword>Computer science</Keyword> <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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Babu, Ramya S"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["An Efficient Algorithm for Relationship Inference"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"cabff802-0879-4196-9be6-5018397cc10f\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>An Efficient Algorithm for Relationship Inference</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-05-30</PublicationDate> <DOI>https://doi.org/10.7298/X4RN363M</DOI> <Authors> <Author> <DisplayName>Babu, Ramya S</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Genetics</Keyword> <Keyword>Efficient</Keyword> <Keyword>Relatedness Inference</Keyword> <Keyword>Computer science</Keyword> <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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Babu, Ramya S"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Williams, Amy L"],"dc:contributor.committeemember":["Clark, Andrew"],"dc:creator":["Babu, Ramya S"],"dc:date.accessioned":["2018-10-23T13:22:40Z"],"dc:date.available":["2018-10-23T13:22:40Z"],"dc:date.issued":["2018-05-30"],"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."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["10489498"],"dc:identifier.doi":["https://doi.org/10.7298/X4RN363M"],"dc:identifier.other":["ProQuest Submission ID: 10313","ProQuest Publication ID: 10822135"],"dc:identifier.uri":["https://hdl.handle.net/1813/59413"],"dc:language.iso":["en_US"],"dc:subject":["Genetics","Efficient","Relatedness Inference","Computer science"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["An Efficient Algorithm for Relationship Inference"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Master of Science"],"thesis:degree_name":["M.S., Computer Science"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:08Z"}