Patents by Inventor Nicolaus Lance Hepler

Nicolaus Lance Hepler 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: 20230368869
    Abstract: A dataset is obtained comprising data blocks, each representing a different characteristic, for a plurality of cells across a plurality of bins, each bin representing a different portion of a reference sequence. Cells are clustered on one such characteristic across the bins thereby forming a tree that includes root, intermediate, and terminal nodes, where the cells are terminal nodes and intermediate nodes have daughter nodes, themselves being intermediate nodes or a cell. A subset of the tree is displayed that includes the root and leaves, each leaf representing an intermediate node or a cell. A heat map of the characteristic is also displayed, the map including a segment for each leaf, across the bins. When a segment represents an intermediate node, it is an average of the characteristic across daughters of the node. Graphs of characteristics for the root across the bins are also displayed.
    Type: Application
    Filed: February 6, 2023
    Publication date: November 16, 2023
    Inventors: Jeffrey Mellen, Kevin J. Wu, Vijay Kumar Sreenivasa Gopalan, Nicolaus Lance Hepler, Jasper Staab
  • Patent number: 11574706
    Abstract: A dataset is obtained comprising data blocks, each representing a different characteristic, for a plurality of cells across a plurality of bins, each bin representing a different portion of a reference sequence. Cells are clustered on one such characteristic across the bins thereby forming a tree that includes root, intermediate, and terminal nodes, where the cells are terminal nodes and intermediate nodes have daughter nodes, themselves being intermediate nodes or a cell. A subset of the tree is displayed that includes the root and leaves, each leaf representing an intermediate node or a cell. A heat map of the characteristic is also displayed, the map including a segment for each leaf, across the bins. When a segment represents an intermediate node, it is an average of the characteristic across daughters of the node. Graphs of characteristics for the root across the bins are also displayed.
    Type: Grant
    Filed: June 27, 2019
    Date of Patent: February 7, 2023
    Assignee: 10X GENOMICS, INC.
    Inventors: Jeffrey Mellen, Kevin J. Wu, Vijay Kumar Sreenivasa Gopalan, Nicolaus Lance Hepler, Jasper Staab
  • Publication number: 20220076780
    Abstract: Methods and systems may be provided for distinguishing cell populations from non-cell populations within a data set, the method comprising receiving a data set at least associated with a plurality of cells, wherein the data set comprises molecule counts of at least two genomic features for each cell; identifying duplicate subsets of data points from the data set; generating deduplicated data by condensing data points from each duplicate subset into a single data point; applying a pre-set threshold to divide the deduplicated data into an initial cell population and a non-cell population, wherein the pre-set threshold is determined using the molecule counts; and generating a refined cell population and a non-cell population by adjusting boundaries of the initial cell population and non-cell population using clustering.
    Type: Application
    Filed: September 2, 2021
    Publication date: March 10, 2022
    Inventors: Arundhati Shamoni Maheshwari, Vijay Kumar Sreenivasa Gopalan, Brett Olsen, Nicolaus Lance Hepler
  • Publication number: 20210241853
    Abstract: Methods for index hopping sequence read filtering are provided. Each read in a plurality of reads from a multiplexed reaction comprises an insert portion, and first (molecular identifier) and second (sample index) non-insert portions. For each of a plurality of hashes, a hash data structure is formed with a representation of each read. Each representation comprises a hash of the first non-insert portion of the corresponding read. Read pairs are identified in the hash data structures. Each pair includes a first and second read sharing a common hash value but differing index values. An entry is added into a heterogeneous data structure, for each such pair, that includes the first and second non-insert portions of the first and second reads of the pair. Reads with first non-insert portion values appearing more than a threshold number of times in the heterogeneous data structure are removed from the plurality of reads.
    Type: Application
    Filed: February 4, 2021
    Publication date: August 5, 2021
    Inventors: Nicolaus Lance Hepler, Chaitanya Aluru, Patrick J. Marks, Niranjan Srinivas, Nigel Delaney
  • Publication number: 20200005902
    Abstract: A dataset is obtained comprising data blocks, each representing a different characteristic, for a plurality of cells across a plurality of bins, each bin representing a different portion of a reference sequence. Cells are clustered on one such characteristic across the bins thereby forming a tree that includes root, intermediate, and terminal nodes, where the cells are terminal nodes and intermediate nodes have daughter nodes, themselves being intermediate nodes or a cell. A subset of the tree is displayed that includes the root and leaves, each leaf representing an intermediate node or a cell. A heat map of the characteristic is also displayed, the map including a segment for each leaf, across the bins. When a segment represents an intermediate node, it is an average of the characteristic across daughters of the node. Graphs of characteristics for the root across the bins are also displayed.
    Type: Application
    Filed: June 27, 2019
    Publication date: January 2, 2020
    Inventors: Jeffrey Mellen, Kevin J. Wu, Vijay Kumar Sreenivasa Gopalan, Nicolaus Lance Hepler, Jasper Staab