Patents by Inventor Fabian Menges

Fabian Menges 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: 20140136468
    Abstract: A system having a processor is programmed to realize practical quantitative assessment of similarity of categorized data. The category data may be stored in a memory as a category graph comprising a graphical data structure having plural parent and child category nodes connected by directed edges, such that sequences of connected category nodes represent hierarchical relations between categories of objects. A similarity metric of a selected pair of categories may be derived, in one embodiment, by analysis of ancestors of the selected pair of categories, including consideration of closest common ancestors in the category graph. Efficiency improvements may include transforming a directed cyclic graph to a directed acyclic graph, and optionally deriving a subgraph to reduce the number of categories under consideration. The software methods may further comprise computing a similarity metric for a pair of objects based on the similarity score for the corresponding pair of categories.
    Type: Application
    Filed: November 13, 2013
    Publication date: May 15, 2014
    Inventors: Peyman Faratin, Fabian Menges
  • 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