Patents by Inventor Peicheng Du

Peicheng Du 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: 20240360179
    Abstract: Among other things, the present disclosure provides various useful agents. In some embodiments, provided agents can bind to beta-catenin. In some embodiments, the present disclosure provides technologies for modulating beta-catenin functions. In some embodiments, the present disclosure provides technologies for preventing and/or treating conditions, disorders or diseases associated with beta-catenin. In some embodiments, the present disclosure provides designed amino acids and agents which can provide improved properties and/or activities.
    Type: Application
    Filed: June 8, 2022
    Publication date: October 31, 2024
    Inventors: Brian Halbert White, Daniel Seungduk La, Lorenzo Josue Alfaro-Lopez, Paula Cristina Ortet, Sarah Isabelle Cappucci, Zhi Li, John Hanney McGee, Martin Robert Tremblay, Gregory L. Verdine, Yaguang Si, Kevin Ling, Peicheng Du, Jonathan Barry Hurov
  • Patent number: 8635258
    Abstract: The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided.
    Type: Grant
    Filed: August 30, 2012
    Date of Patent: January 21, 2014
    Assignee: International Business Machines Corporation
    Inventors: Peicheng Du, Frank Suits
  • Patent number: 8631057
    Abstract: The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided.
    Type: Grant
    Filed: August 25, 2009
    Date of Patent: January 14, 2014
    Assignee: International Business Machines Corporation
    Inventors: Peicheng Du, Frank Suits
  • Patent number: 8486268
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Grant
    Filed: February 28, 2012
    Date of Patent: July 16, 2013
    Assignee: International Business Machines Corporation
    Inventors: Peicheng Du, Frank Suits
  • Patent number: 8372288
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Grant
    Filed: February 28, 2012
    Date of Patent: February 12, 2013
    Assignee: International Business Machines Corporation
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20120323985
    Abstract: The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided.
    Type: Application
    Filed: August 30, 2012
    Publication date: December 20, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20120158317
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Application
    Filed: February 28, 2012
    Publication date: June 21, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20120158316
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Application
    Filed: February 28, 2012
    Publication date: June 21, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits
  • Patent number: 8158003
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Grant
    Filed: August 26, 2009
    Date of Patent: April 17, 2012
    Assignee: International Business Machines Corporation
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20110055301
    Abstract: The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided.
    Type: Application
    Filed: August 25, 2009
    Publication date: March 3, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20110049349
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Application
    Filed: August 26, 2009
    Publication date: March 3, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits