Patents by Inventor Tai-he Xia

Tai-he Xia 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: 20130198182
    Abstract: A method, system and program for facilitating consideration of clearance of a target sequence. The method comprises retrieving a predefined patent document library data structure having fields for claim identifiers, a matching criterion for a comparison, translated claim statements, matching procedures, sequence identifiers, logical relationships between claim statements and machine readable comparison instructions; retrieving a sequence database indexed by sequence identifier, comparing the target sequence with each of the claims in the retrieved patent document library data structure, using a corresponding machine readable comparison instructions and a sequence which is obtained from the retrieved sequence database corresponding to a sequence identified in the claim and determining whether each of claims in the retrieved patent document library data structure matches the target sequence based upon a result of the comparison.
    Type: Application
    Filed: July 31, 2012
    Publication date: August 1, 2013
    Applicant: SANOFI
    Inventors: Amar Mohan DRAWID, Tai-He XIA
  • Publication number: 20030059869
    Abstract: Novel GAVE3 polypeptides, proteins and nucleic acid molecules are provided. In addition to isolated, full-length GAVE3 proteins, isolated GAVE3 fusion proteins, antigenic peptides and anti-GAVE3 antibodies are taught.
    Type: Application
    Filed: June 22, 2001
    Publication date: March 27, 2003
    Inventors: Tai-He Xia, Donghui Ni, Haifeng Eishingdrelo, Ali Ardati, Anne Minnich, Ray Jupp
  • Publication number: 20020133498
    Abstract: Conditional associations among features in samples are identified by defining a matrix having rows that represent the samples and columns that represent the features. Each row-column position of the matrix has a first binary value if the sample that is associated with the row exhibits the feature that is associated with the column, and a second binary value if a sample that is associated with the row does not exhibit the feature that is associated with the column. Recursive partitioning then is performed for each column. In particular, for each column, the column is recursively partitioned relative to the remaining ones of the columns, to define a tree of conditional branches for the rows for each column. The collection of trees of conditional branches for the columns may be displayed and/or analyzed to identify conditional associations of interest. Continuous features, wherein each row-column position of the matrix has a value selected from a continuous range of values, also may be analyzed.
    Type: Application
    Filed: January 11, 2002
    Publication date: September 19, 2002
    Inventors: Christopher E. Keefer, Sidney Stanley Young, Tai-he Xia