Patents by Inventor Laxmi Priya Parida

Laxmi Priya Parida 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).

  • Method and system for comparative genomics
    Patent number: 8738298
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Grant
    Filed: August 7, 2012
    Date of Patent: May 27, 2014
    Assignee: International Business Machines Corporation
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • Methods and systems for reconstructing genomic common ancestors
    Patent number: 8700334
    Abstract: Methods and systems for reconstructing common ancestors include determining a PQ tree structure based upon permutations between two genomes, and reconstructing an ancestor genome based upon the PQ tree structure. A PQ tree includes a first internal node (P node) that allows a permutation of the children thereof, and a second internal node (Q node) that maintains a unidirectional order of the children thereof.
    Type: Grant
    Filed: July 31, 2006
    Date of Patent: April 15, 2014
    Assignee: International Business Machines Corporation
    Inventor: Laxmi Priya Parida
  • METHOD AND SYSTEM FOR COMPARATIVE GENOMICS
    Publication number: 20120303285
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Application
    Filed: August 7, 2012
    Publication date: November 29, 2012
    Applicant: International Business Machines Corporation
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • METHODS AND SYSTEMS FOR CONSERVATIVE EXTRACTION OF OVER-REPRESENTED EXTENSIBLE MOTIFS
    Publication number: 20120303287
    Abstract: Methods and systems of extracting extensible motifs from a sequence include assigning a significance to extensible motifs within the sequence based upon a syntactic and statistical analysis, and identifying extensible motifs having a significance that exceeds a predetermined threshold.
    Type: Application
    Filed: August 6, 2012
    Publication date: November 29, 2012
    Applicant: International Business Machines Corporation
    Inventors: Alberto Apostolico, Matteo Comin, Laxmi Priya Parida
  • Methods and systems for conservative extraction of over-represented extensible motifs
    Patent number: 8290716
    Abstract: Methods and systems of extracting extensible motifs from a sequence include assigning a significance to extensible motifs within the sequence based upon a syntactic and statistical analysis, and identifying extensible motifs having a significance that exceeds a predetermined threshold.
    Type: Grant
    Filed: September 15, 2010
    Date of Patent: October 16, 2012
    Assignee: International Business Machines Corporation
    Inventors: Alberto Apostolico, Matteo Comin, Laxmi Priya Parida
  • Method and system for comparative genomics
    Patent number: 8275555
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Grant
    Filed: January 7, 2011
    Date of Patent: September 25, 2012
    Assignee: International Business Machines Corporation
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • METHOD AND SYSTEM FOR COMPARATIVE GENOMICS
    Publication number: 20110106454
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Application
    Filed: January 7, 2011
    Publication date: May 5, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • System and method for identifying a gapped permutation pattern
    Patent number: 7917305
    Abstract: A system and method for identifying gapped permutation patterns, includes discovering all clusters in the input data sequence that occur with a predetermined gap.
    Type: Grant
    Filed: January 3, 2007
    Date of Patent: March 29, 2011
    Assignee: International Business Machines Corporation
    Inventor: Laxmi Priya Parida
  • Method and system for comparative genomics
    Patent number: 7881874
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Grant
    Filed: June 16, 2006
    Date of Patent: February 1, 2011
    Assignee: International Business Machines Corporation
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • METHODS AND SYSTEMS FOR CONSERVATIVE EXTRACTION OF OVER-REPRESENTED EXTENSIBLE MOTIFS
    Publication number: 20110004416
    Abstract: Methods and systems of extracting extensible motifs from a sequence include assigning a significance to extensible motifs within the sequence based upon a syntactic and statistical analysis, and identifying extensible motifs having a significance that exceeds a predetermined threshold.
    Type: Application
    Filed: September 15, 2010
    Publication date: January 6, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Alberto Apostolico, Matteo Comin, Laxmi Priya Parida
  • Methods and systems for conservative extraction of over-represented extensible motifs
    Patent number: 7865313
    Abstract: Methods and systems of extracting extensible motifs from a sequence include assigning a significance to extensible motifs within the sequence based upon a syntactic and statistical analysis, and identifying extensible motifs having a significance that exceeds a predetermined threshold.
    Type: Grant
    Filed: June 21, 2006
    Date of Patent: January 4, 2011
    Assignee: International Business Machines Corporation
    Inventors: Alberto Apostolico, Matteo Comin, Laxmi Priya Parida
  • Apparatus, system and method for data compression using irredundant patterns
    Patent number: 7479905
    Abstract: An apparatus for data compression includes an identifier which identifies a plurality of irredundant patterns in a data set, and an extractor which extracts at least a portion of the plurality of irredundant patterns from the data set to generate a compressed data set.
    Type: Grant
    Filed: July 28, 2003
    Date of Patent: January 20, 2009
    Assignee: International Business Machines Corporation
    Inventors: Laxmi Priya Parida, Alberto Apostolico
  • SYSTEM AND METHOD FOR IDENTIFYING A GAPPED PERMUTATION PATTERN
    Publication number: 20080162102
    Abstract: A system and method for identifying gapped permutation patterns, includes discovering all clusters in the input data sequence that occur with a predetermined gap.
    Type: Application
    Filed: January 3, 2007
    Publication date: July 3, 2008
    Inventor: Laxmi Priya Parida
  • Methods and systems for reconstructing genomic common ancestors
    Publication number: 20080027656
    Abstract: Methods and systems for reconstructing common ancestors include determining a PQ tree structure based upon permutations between two genomes, and reconstructing an ancestor genome based upon the PQ tree structure. A PQ tree includes a first internal node (P node) that allows a permutation of the children thereof, and a second internal node (Q node) that maintains a unidirectional order of the children thereof.
    Type: Application
    Filed: July 31, 2006
    Publication date: January 31, 2008
    Applicant: International Business Machines Corporation
    Inventor: Laxmi Priya Parida
  • Methods and systems for conservative extraction of over-represented extensible motifs
    Publication number: 20070299615
    Abstract: Methods and systems of extracting extensible motifs from a sequence include assigning a significance to extensible motifs within the sequence based upon a syntactic and statistical analysis, and identifying extensible motifs having a significance that exceeds a predetermined threshold.
    Type: Application
    Filed: June 21, 2006
    Publication date: December 27, 2007
    Applicant: International Business Machines Corporation
    Inventors: Alberto Apostolico, Matteo Comin, Laxmi Priya Parida
  • Method and system for comparative genomics
    Publication number: 20070294038
    Abstract: A method and system for representing a similarity between at least two genomes that includes detecting gene clusters which are common to the at least two genomes and representing the common gene clusters in a PQ tree. The PQ tree includes a first internal node (P node), that allows permutation of the children thereof, and a second internal node (Q node), that maintains unidirectional order of the children thereof.
    Type: Application
    Filed: June 16, 2006
    Publication date: December 20, 2007
    Applicant: International Business Machines Corporation
    Inventors: Gad M. Landau, Laxmi Priya Parida, Oren Weimann
  • Method and structure for lossy compression of continuous data with extensible motifs
    Patent number: 7259701
    Abstract: A method (and structure) of data processing in which data is represented in a lossy data format as a plurality of extensible motifs. Each extensible motif has at least one don't-care character enclosed by at least one non-don't-care character on a left side and at least one non-don't-care character on a right side.
    Type: Grant
    Filed: January 18, 2006
    Date of Patent: August 21, 2007
    Assignee: International Business Machines Corporation
    Inventors: Laxmi Priya Parida, Alberto Apostolico, Matteo Comin