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...

Full description

Saved in:
Bibliographic Details
Main Authors CURTIS, Ross E, GIRSHICK, Ahna R, ANDERSON, Ariel Hippen
Format Patent
LanguageEnglish
French
German
Published 28.04.2021
Subjects
INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Application Number: EP20190823025