FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST

FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST

A computing server generates a graph such as an identity-by-descent (IBD) network. The graph includes a plurality of nodes. Each node represents one of the individuals. Two or more nodes are connected through edges. Each edge connecting two nodes and associated with a weight that is derived from aff...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Girshick, Ahna R, Anderson, Ariel Hippen, Curtis, Ross E
Format: Patent
Sprache:eng
Schlagworte:
INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Girshick, Ahna R
Anderson, Ariel Hippen
Curtis, Ross E
description A computing server generates a graph such as an identity-by-descent (IBD) network. The graph includes a plurality of nodes. Each node represents one of the individuals. Two or more nodes are connected through edges. Each edge connecting two nodes and associated with a weight that is derived from affinity between the genetic data of the two individuals represented by the two nodes. The computing system filters the graph based on features that are associated with the edges or the nodes. The filtered graph includes a subset of nodes. The computing system divides the filtered graph into a plurality of clusters to identify genetic communities that may not be discoverable without filtering. The computing server may also perform a multi-path hierarchical community detection process to assign an individual represented by a node to more than one community.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2022076789A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2022076789A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2022076789A13</originalsourceid><addsrcrecordid>eNrjZLBz8_QJcQ3y9HNXcHf1cw3xdFYAkuH-Qd7BCiH-Ci6ewc7-Ya5BCgH-AaE-jiGe_n7BCv5uCp5-QE2uwSE8DKxpiTnFqbxQmptB2c01xNlDN7UgPz61uCAxOTUvtSQ-NNjIwMjIwNzM3MLS0dCYOFUANrErkg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST</title><source>esp@cenet</source><creator>Girshick, Ahna R ; Anderson, Ariel Hippen ; Curtis, Ross E</creator><creatorcontrib>Girshick, Ahna R ; Anderson, Ariel Hippen ; Curtis, Ross E</creatorcontrib><description>A computing server generates a graph such as an identity-by-descent (IBD) network. The graph includes a plurality of nodes. Each node represents one of the individuals. Two or more nodes are connected through edges. Each edge connecting two nodes and associated with a weight that is derived from affinity between the genetic data of the two individuals represented by the two nodes. The computing system filters the graph based on features that are associated with the edges or the nodes. The filtered graph includes a subset of nodes. The computing system divides the filtered graph into a plurality of clusters to identify genetic communities that may not be discoverable without filtering. The computing server may also perform a multi-path hierarchical community detection process to assign an individual represented by a node to more than one community.</description><language>eng</language><subject>INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS ; PHYSICS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220310&amp;DB=EPODOC&amp;CC=US&amp;NR=2022076789A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76516</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220310&amp;DB=EPODOC&amp;CC=US&amp;NR=2022076789A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Girshick, Ahna R</creatorcontrib><creatorcontrib>Anderson, Ariel Hippen</creatorcontrib><creatorcontrib>Curtis, Ross E</creatorcontrib><title>FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST</title><description>A computing server generates a graph such as an identity-by-descent (IBD) network. The graph includes a plurality of nodes. Each node represents one of the individuals. Two or more nodes are connected through edges. Each edge connecting two nodes and associated with a weight that is derived from affinity between the genetic data of the two individuals represented by the two nodes. The computing system filters the graph based on features that are associated with the edges or the nodes. The filtered graph includes a subset of nodes. The computing system divides the filtered graph into a plurality of clusters to identify genetic communities that may not be discoverable without filtering. The computing server may also perform a multi-path hierarchical community detection process to assign an individual represented by a node to more than one community.</description><subject>INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLBz8_QJcQ3y9HNXcHf1cw3xdFYAkuH-Qd7BCiH-Ci6ewc7-Ya5BCgH-AaE-jiGe_n7BCv5uCp5-QE2uwSE8DKxpiTnFqbxQmptB2c01xNlDN7UgPz61uCAxOTUvtSQ-NNjIwMjIwNzM3MLS0dCYOFUANrErkg</recordid><startdate>20220310</startdate><enddate>20220310</enddate><creator>Girshick, Ahna R</creator><creator>Anderson, Ariel Hippen</creator><creator>Curtis, Ross E</creator><scope>EVB</scope></search><sort><creationdate>20220310</creationdate><title>FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST</title><author>Girshick, Ahna R ; Anderson, Ariel Hippen ; Curtis, Ross E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2022076789A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</creationdate><topic>INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Girshick, Ahna R</creatorcontrib><creatorcontrib>Anderson, Ariel Hippen</creatorcontrib><creatorcontrib>Curtis, Ross E</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Girshick, Ahna R</au><au>Anderson, Ariel Hippen</au><au>Curtis, Ross E</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST</title><date>2022-03-10</date><risdate>2022</risdate><abstract>A computing server generates a graph such as an identity-by-descent (IBD) network. The graph includes a plurality of nodes. Each node represents one of the individuals. Two or more nodes are connected through edges. Each edge connecting two nodes and associated with a weight that is derived from affinity between the genetic data of the two individuals represented by the two nodes. The computing system filters the graph based on features that are associated with the edges or the nodes. The filtered graph includes a subset of nodes. The computing system divides the filtered graph into a plurality of clusters to identify genetic communities that may not be discoverable without filtering. The computing server may also perform a multi-path hierarchical community detection process to assign an individual represented by a node to more than one community.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2022076789A1
source esp@cenet
subjects INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS
PHYSICS
title FILTERING GENETIC NETWORKS TO DISCOVER POPULATIONS OF INTEREST
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T05%3A27%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Girshick,%20Ahna%20R&rft.date=2022-03-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2022076789A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true