Patents by Inventor David Andrew Turissini

David Andrew Turissini has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20240054121
    Abstract: A computing server may scan through a named-entity data store to identify a plurality of candidate named-entity data instances. The computing server may identify one or more upper-level nodes in the corresponding data tree where the named entity is represented as a node. The computing server may determine, for each candidate named-entity data instance associated with the corresponding data tree, geographical location tags of the one or more upper-level nodes. The computing server may determine, based on the geographical location tags, the candidate named-entity data instance is a named-entity data instance typically associated with a geographical location. The computing server may identify a plurality of named-entity data instances that are typically associated with the geographical location. The computing server may aggregate data characteristics of the named-entity data instances that are typically associated with the geographical location.
    Type: Application
    Filed: August 15, 2023
    Publication date: February 15, 2024
    Inventors: David Andrew Turissini, Yong Wang
  • Publication number: 20200082909
    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.
    Type: Application
    Filed: September 11, 2019
    Publication date: March 12, 2020
    Inventors: Yong Wang, Alisa Sedghifar, Shiya Song, David Andrew Turissini
  • Publication number: 20200082905
    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.
    Type: Application
    Filed: September 11, 2019
    Publication date: March 12, 2020
    Inventors: Shiya Song, David Andrew Turissini, Yong Wang, Jake Kelly Byrnes