Patents by Inventor Giuseppe Narzisi

Giuseppe Narzisi 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: 20210217490
    Abstract: Exemplary methods, procedures, computer-accessible medium, and systems for base-calling, aligning and polymorphism detection and analysis using raw output from a sequencing platform can be provided. A set of raw outputs can be used to detect polymorphisms in an individual by obtaining a plurality of sequence read data from one or more technologies (e.g., using sequencing-by-synthesis, sequencing-by-ligation, sequencing-by-hybridization, Sanger sequencing, etc.). For example, provided herein are exemplary methods, procedures, computer-accessible medium and systems, which can include and/or be configured for obtaining raw output from a sequencing platform configured to be used for reading fragment(s) of genomes, obtaining reference sequences for the genomes obtained independently from the raw output, and generating a base-call interpretation and/or alignment using the raw output and the reference sequences.
    Type: Application
    Filed: March 29, 2021
    Publication date: July 15, 2021
    Inventors: Bhubaneswar MISHRA, Giuseppe NARZISI
  • Patent number: 10964408
    Abstract: Exemplary methods, procedures, computer-accessible medium, and systems for base-calling, aligning and polymorphism detection and analysis using raw output from a sequencing platform can be provided. A set of raw outputs can be used to detect polymorphisms in an individual by obtaining a plurality of sequence read data from one or more technologies (e.g., using sequencing-by-synthesis, sequencing-by-ligation, sequencing-by-hybridization, Sanger sequencing, etc.). For example, provided herein are exemplary methods, procedures, computer-accessible medium and systems, which can include and/or be configured for obtaining raw output from a sequencing platform configured to be used for reading fragment(s) of genomes, obtaining reference sequences for the genomes obtained independently from the raw output, and generating a base-call interpretation and/or alignment using the raw output and the reference sequences.
    Type: Grant
    Filed: April 27, 2010
    Date of Patent: March 30, 2021
    Assignee: New York University
    Inventors: Bhubaneswar Mishra, Giuseppe Narzisi
  • Patent number: 10839940
    Abstract: Exemplary embodiments of the present disclosure relate generally to methods, computer-accessible medium and systems for assembling haplotype and/or genotype sequences of at least one genome, which can be based upon, e.g., consistent layouts of short sequence reads and long-range genome related data. For example, a processing arrangement can be configured to perform a procedure including, e.g., obtaining randomly located short sequence reads, using at least one score function in combination with constraints based on, e.g., the long range data, generating a layout of randomly located short sequence reads such that the layout is globally optimal with respect to the score function, obtained through searching coupled with score and constraint dependent pruning to determine the globally optimal layout substantially satisfying the constraints, generating a whole and/or a part of a genome wide haplotype sequence and/or genotype sequence, and converting a globally optimal layout into one or more consensus sequences.
    Type: Grant
    Filed: December 23, 2009
    Date of Patent: November 17, 2020
    Assignee: NEW YORK UNIVERSITY
    Inventors: Bhubaneswar Mishra, Giuseppe Narzisi
  • Publication number: 20130317755
    Abstract: Exemplary systems, methods and computer-accessible mediums for assembling at least one haplotype or genotype sequence of at least one genome can be provided, which can include, obtaining a plurality of randomly located sequence reads, incrementally generating overlap relations between the randomly located sequence reads using a plurality of overlapper procedures, and generating a layout of some of the randomly located short sequence reads based on a function in combination with constraints based on information associated with the one genome while substantially satisfying the constraints. The score-function can be derived from overlap relations between the randomly located short sequence reads. A search can be performed together with score- and constraint-dependent pruning to determine the layout substantially satisfying the constraints. A part of the genome wide haplotype sequence or the genotype sequence of the genome can be generated based on the overlap relations and the randomly located sequence reads.
    Type: Application
    Filed: May 6, 2013
    Publication date: November 28, 2013
    Applicant: New York University
    Inventors: Bhubaneswar Mishra, Andreas Witzel, Fabian Menges, Giuseppe Narzisi
  • Publication number: 20120116688
    Abstract: Exemplary methods, procedures, computer-accessible medium, and systems for base-calling, aligning and polymorphism detection and analysis using raw output from a sequencing platform can be provided. A set of raw outputs can be used to detect polymorphisms in an individual by obtaining a plurality of sequence read data from one or more technologies (e.g., using sequencing-by-synthesis, sequencing-by-ligation, sequencing-by-hybridization, Sanger sequencing, etc.). For example, provided herein are exemplary methods, procedures, computer-accessible medium and systems, which can include and/or be configured for obtaining raw output from a sequencing platform configured to be used for reading fragment(s) of genomes, obtaining reference sequences for the genomes obtained independently from the raw output, and generating a base-call interpretation and/or alignment using the raw output and the reference sequences.
    Type: Application
    Filed: April 27, 2010
    Publication date: May 10, 2012
    Applicant: New York University
    Inventors: Bhubaneswar Mishra, Giuseppe Narzisi
  • Publication number: 20120041727
    Abstract: Exemplary embodiments of the present disclosure relate generally to methods, computer-accessible medium and systems for assembling haplotype and/or genotype sequences of at least one genome, which can be based upon, e.g., consistent layouts of short sequence reads and long-range genome related data. For example, a processing arrangement can be configured to perform a procedure including, e.g., obtaining randomly located short sequence reads, using at least one score function in combination with constraints based on, e.g., the long range data, generating a layout of randomly located short sequence reads such that the layout is globally optimal with respect to the score function, obtained through searching coupled with score and constraint dependent pruning to determine the globally optimal layout substantially satisfying the constraints, generating a whole and/or a part of a genome wide haplotype sequence and/or genotype sequence, and converting a globally optimal layout into one or more consensus sequences.
    Type: Application
    Filed: December 23, 2009
    Publication date: February 16, 2012
    Applicant: New York University
    Inventors: Bhubaneswar Mishra, Giuseppe Narzisi
  • Patent number: 8015127
    Abstract: Agent-based models (ABMs)/multi-agent systems (MASs) are one of the most widely used modeling-simulation-analysis approaches for understanding the dynamical behavior of complex systems. These models can be often characterized by several parameters with nonlinear interactions which together determine the global system dynamics, usually measured by different conflicting criteria. One problem that can emerge is that of tuning the controllable system parameters at the local level, in order to reach some desirable global behavior. According to one exemplary embodiment t of the present invention, the tuning of an ABM for emergency response planning can be cast as a multi-objective optimization problem (MOOP). Further, the use of multi-objective evolutionary algorithms (MOEAs) and procedures for exploration and optimization of the resultant search space can be utilized. It is possible to employ conventional MOEAs, e.g.
    Type: Grant
    Filed: September 12, 2007
    Date of Patent: September 6, 2011
    Assignee: New York University
    Inventors: Giuseppe Narzisi, Bhubaneswar Mishra, Venkatesh Mysore
  • Publication number: 20080215512
    Abstract: Agent-based models (ABMs)/multi-agent systems (MASs) are one of the most widely used modeling-simulation-analysis approaches for understanding the dynamical behavior of complex systems. These models can be often characterized by several parameters with nonlinear interactions which together determine the global system dynamics, usually measured by different conflicting criteria. One problem that can emerge is that of tuning the controllable system parameters at the local level, in order to reach some desirable global behavior. According to one exemplary embodiment t of the present invention, the tuning of an ABM for emergency response planning can be cast as a multi-objective optimization problem (MOOP). Further, the use of multi-objective evolutionary algorithms (MOEAs) and procedures for exploration and optimization of the resultant search space can be utilized. It is possible to employ conventional MOEAs, e.g.
    Type: Application
    Filed: September 12, 2007
    Publication date: September 4, 2008
    Applicant: New York University
    Inventors: Giuseppe Narzisi, Bhubaneswar Mishra, Venkatesh Mysore