Abstract: A user may select one or more potential common ancestors with a DNA match to view the target individual's relationship with them. The process may include identifying, from a first genealogical profile of the target individual. A first individual has a first linkage that connects the target individual towards the selected potential common ancestor. The process may also include identifying, from a second genealogical profile of the DNA match, a second individual who has a second linkage that connects the DNA match towards the selected potential common ancestor. The process may further include connecting the first linkage and the second linkage with the selected potential common ancestor by adding one or more individuals whose profiles are retrieved from other searchable genealogical profiles stored in the online system. With the nodes and connections available, the process may generate a map of visual connections between the target individual and the DNA match.

Abstract: Disclosed are techniques for predicting a trait of an individual and identifying a set of enriched record collections of a genetic community. To predict a trait of an individual, DNA features and non-DNA features of the individual are accessed to generate a feature vector that is inputted into a machine learning model. The machine learning model generates a prediction of the trait. The prediction may be based on an inheritance prediction and/or a community prediction. To identify a set of enriched record collections, individuals belonging to a genetic community are identified and a set of candidate record collections are accessed. A community count and a background count is determined for each candidate record collection. The set of enriched record collections are identified based on a comparison of the community count and the background count. The genetic community may be annotated using the set of enriched record collections.

Abstract: Disclosed is a configuration for determining a genotyping label composition of a target individual using direct acyclic paths. The configuration includes receiving a phased genotype of the target individual, including a first haplotype and a second haplotype. The configuration initiates a full-ethnicity hidden Markov model (HMM) including nodes with a set of ethnicity labels. The first haplotype is input to determine a first subset of ethnicity labels that match the first haplotype. The second haplotype is input to determine a second subset of ethnicity labels that match the second haplotype. The first and second subsets of ethnicity labels are combined to create a candidate subset of ethnicity labels for the target individual. The configuration initiates a simplified HMM with nodes from the candidate subset of ethnicity labels. The phased genotype of the target individual is input to the simplified HMM to determine genotyping label composition of the target individual.

Abstract: Disclosed are techniques for predicting a trait of an individual and identifying a set of enriched record collections of a genetic community. To predict a trait of an individual, DNA features and non-DNA features of the individual are accessed to generate a feature vector that is inputted into a machine learning model. The machine learning model generates a prediction of the trait. The prediction may be based on an inheritance prediction and/or a community prediction. To identify a set of enriched record collections, individuals belonging to a genetic community are identified and a set of candidate record collections are accessed. A community count and a background count is determined for each candidate record collection. The set of enriched record collections are identified based on a comparison of the community count and the background count. The genetic community may be annotated using the set of enriched record collections.

Abstract: A user may select one or more potential common ancestors with a DNA match to view the target individual's relationship with them. The process may include identifying, from a first genealogical profile of the target individual. A first individual has a first linkage that connects the target individual towards the selected potential common ancestor. The process may also include identifying, from a second genealogical profile of the DNA match, a second individual who has a second linkage that connects the DNA match towards the selected potential common ancestor. The process may further include connecting the first linkage and the second linkage with the selected potential common ancestor by adding one or more individuals whose profiles are retrieved from other searchable genealogical profiles stored in the online system. With the nodes and connections available, the process may generate a map of visual connections between the target individual and the DNA match.

Abstract: The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree.

Abstract: A user may select one or more potential common ancestors with a DNA match to view the target individual's relationship with them. The process may include identifying, from a first genealogical profile of the target individual. A first individual has a first linkage that connects the target individual towards the selected potential common ancestor. The process may also include identifying, from a second genealogical profile of the DNA match, a second individual who has a second linkage that connects the DNA match towards the selected potential common ancestor. The process may further include connecting the first linkage and the second linkage with the selected potential common ancestor by adding one or more individuals whose profiles are retrieved from other searchable genealogical profiles stored in the online system. With the nodes and connections available, the process may generate a map of visual connections between the target individual and the DNA match.

Abstract: The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree.

Abstract: The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree.

Abstract: Disclosed are techniques for predicting a trait of an individual and identifying a set of enriched record collections of a genetic community. To predict a trait of an individual, DNA features and non-DNA features of the individual are accessed to generate a feature vector that is inputted into a machine learning model. The machine learning model generates a prediction of the trait. The prediction may be based on an inheritance prediction and/or a community prediction. To identify a set of enriched record collections, individuals belonging to a genetic community are identified and a set of candidate record collections are accessed. A community count and a background count is determined for each candidate record collection. The set of enriched record collections are identified based on a comparison of the community count and the background count. The genetic community may be annotated using the set of enriched record collections.

Abstract: A system divides an input genotype dataset into a plurality of windows, each including a sequence of SNPs and determines a pair of phased haplotype datasets from the plurality of windows of genotype datasets. For at least one window, a plurality of emission probabilities are determined using one or more CNN models that take phased haplotypes as input and generates emission probabilities as output, where the emission probability corresponds to a probability of observing the pair of phased haplotype datasets within the window given a pair of ethnicity labels. The system then generates a directed acyclic graph that comprises a plurality of node groups and a plurality of edges, wherein the node group corresponding to the particular window comprises a plurality of nodes and each node is associated with one of the emission probabilities. Based on the directed acyclic graph, the system generates information on ethnic origin of the individual.

Abstract: Disclosed are techniques for predicting a trait of an individual and identifying a set of enriched record collections of a genetic community. To predict a trait of an individual, DNA features and non-DNA features of the individual are accessed to generate a feature vector that is inputted into a machine learning model. The machine learning model generates a prediction of the trait. The prediction may be based on an inheritance prediction and/or a community prediction. To identify a set of enriched record collections, individuals belonging to a genetic community are identified and a set of candidate record collections are accessed. A community count and a background count is determined for each candidate record collection. The set of enriched record collections are identified based on a comparison of the community count and the background count. The genetic community may be annotated using the set of enriched record collections.

Abstract: An input genotype is divided into a plurality of windows, each including a sequence of SNPs. For each window, a diploid HMM is computed based on genotypes and/or phased haplotypes to determine a probability of a haplotype sequence being associated with a particular label. For example, the diploid HMM for a window is used to determine the emission probability that the window corresponds to a set of labels. An inter-window HMM, with a set of states for each window, is computed. Labels are assigned to the input genotype based on the inter-window HMM. Upper and lower bounds are estimated to produce a range of likely percentage values an input can be assigned to a given label. Confidence values are determined indicating a likelihood that an individual inherits DNA from a certain population. Maps are generated with polygons representing regions where a measure of ethnicity of population falls within specific ranges.

Abstract: A user may select one or more potential common ancestors with a DNA match to view the target individual's relationship with them. The process may include identifying, from a first genealogical profile of the target individual. A first individual has a first linkage that connects the target individual towards the selected potential common ancestor. The process may also include identifying, from a second genealogical profile of the DNA match, a second individual who has a second linkage that connects the DNA match towards the selected potential common ancestor. The process may further include connecting the first linkage and the second linkage with the selected potential common ancestor by adding one or more individuals whose profiles are retrieved from other searchable genealogical profiles stored in the online system. With the nodes and connections available, the process may generate a map of visual connections between the target individual and the DNA match.

Abstract: An input genotype is divided into a plurality of windows, each including a sequence of SNPs. For each window, a diploid HMM is computed based on genotypes and/or phased haplotypes to determine a probability of a haplotype sequence being associated with a particular label. For example, the diploid HMM for a window is used to determine the emission probability that the window corresponds to a set of labels. An inter-window HMM, with a set of states for each window, is computed. Labels are assigned to the input genotype based on the inter-window HMM. Upper and lower bounds are estimated to produce a range of likely percentage values an input can be assigned to a given label. Confidence values are determined indicating a likelihood that an individual inherits DNA from a certain population. Maps are generated with polygons representing regions where a measure of ethnicity of population falls within specific ranges.

Abstract: Disclosed are techniques for predicting a trait of an individual and identifying a set of enriched record collections of a genetic community. To predict a trait of an individual, DNA features and non-DNA features of the individual are accessed to generate a feature vector that is inputted into a machine learning model. The machine learning model generates a prediction of the trait. The prediction may be based on an inheritance prediction and/or a community prediction. To identify a set of enriched record collections, individuals belonging to a genetic community are identified and a set of candidate record collections are accessed. A community count and a background count is determined for each candidate record collection. The set of enriched record collections are identified based on a comparison of the community count and the background count. The genetic community may be annotated using the set of enriched record collections.

Abstract: An input genotype is divided into a plurality of windows, each including a sequence of SNPs. For each window, a diploid HMM is computed based on genotypes and/or phased haplotypes to determine a probability of a haplotype sequence being associated with a particular label. For example, the diploid HMM for a window is used to determine the emission probability that the window corresponds to a set of labels. An inter-window HMM, with a set of states for each window, is computed. Labels are assigned to the input genotype based on the inter-window HMM. Upper and lower bounds are estimated to produce a range of likely percentage values an input can be assigned to a given label. Confidence values are determined indicating a likelihood that an individual inherits DNA from a certain population. Maps are generated with polygons representing regions where a measure of ethnicity of population falls within specific ranges.

Abstract: An input genotype is divided into a plurality of windows, each including a sequence of SNPs. For each window, a diploid HMM is computed based on genotypes and/or phased haplotypes to determine a probability of a haplotype sequence being associated with a particular label. For example, the diploid HMM for a window is used to determine the emission probability that the window corresponds to a set of labels. An inter-window HMM, with a set of states for each window, is computed. Labels are assigned to the input genotype based on the inter-window HMM. Upper and lower bounds are estimated to produce a range of likely percentage values an input can be assigned to a given label. Confidence values are determined indicating a likelihood that an individual inherits DNA from a certain population. Maps are generated with polygons representing regions where a measure of ethnicity of population falls within specific ranges.

Abstract: An input genotype is divided into a plurality of windows, each including a sequence of SNPs. For each window, a diploid HMM is computed based on genotypes and/or phased haplotypes to determine a probability of a haplotype sequence being associated with a particular label. For example, the diploid HMM for a window is used to determine the emission probability that the window corresponds to a set of labels. An inter-window HMM, with a set of states for each window, is computed. Labels are assigned to the input genotype based on the inter-window HMM. Upper and lower bounds are estimated to produce a range of likely percentage values an input can be assigned to a given label. Confidence values are determined indicating a likelihood that an individual inherits DNA from a certain population. Maps are generated with polygons representing regions where a measure of ethnicity of population falls within specific ranges.