Patents by Inventor Paolo Ferragina
Paolo Ferragina 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).
-
Patent number: 12002547Abstract: The present disclosure is directed to enabling search and extraction of data stored in DNA with optimized data structures and functions. Accordingly, systems and methods are provided herein for performing certain functions on data stored in nucleic acid molecules. The present disclosure covers at least the following areas of interest: (1) data structures to provide efficient access and search of information stored in nucleic acid molecules, (2) accurate and quick reading of information stored in nucleic acid molecules, (3) targeted approaches to accessing subsets of information stored in nucleic acid molecules, (4) a rank function that determines a count of particular bit or symbol value in a set of information stored in nucleic acid molecules, (5) functions including counting, locating, and extracting occurrences of a specific pattern in a message of information stored in nucleic acid molecules, and (6) an if-then-else operation to sort data stored in nucleic acid molecules.Type: GrantFiled: February 9, 2023Date of Patent: June 4, 2024Assignee: CATALOG TECHNOLOGIES, INC.Inventors: Nathaniel Roquet, Swapnil P. Bhatia, Paolo Ferragina
-
Publication number: 20240119027Abstract: compression and search process on a data set based on multiple strategies, including extracting a set of raw data and transforming it into a sequence of symbols, manipulating the sequence by combining data structures and one or more (optionally a multiplicity of) compression strategies to obtain compressed and efficiently searchable data, recording the compressed and efficiently searchable data on storage media.Type: ApplicationFiled: October 6, 2022Publication date: April 11, 2024Inventors: Paolo FERRAGINA, Giovanni MANZINI, Giorgio VINCIGUERRA
-
Publication number: 20240055075Abstract: The present disclosure is directed to enabling search and extraction of data stored in DNA with optimized data structures and functions. Accordingly, systems and methods are provided herein for performing certain functions on data stored in nucleic acid molecules. The present disclosure covers at least the following areas of interest: (1) data structures to provide efficient access and search of information stored in nucleic acid molecules, (2) accurate and quick reading of information stored in nucleic acid molecules, (3) targeted approaches to accessing subsets of information stored in nucleic acid molecules, (4) a rank function that determines a count of particular bit or symbol value in a set of information stored in nucleic acid molecules, (5) functions including counting, locating, and extracting occurrences of a specific pattern in a message of information stored in nucleic acid molecules, and (6) an if-then-else operation to sort data stored in nucleic acid molecules.Type: ApplicationFiled: February 9, 2023Publication date: February 15, 2024Inventors: Nathaniel Roquet, Swapnil P. Bhatia, Paolo Ferragina
-
Patent number: 11610651Abstract: The present disclosure is directed to enabling search and extraction of data stored in DNA with optimized data structures and functions. Accordingly, systems and methods are provided herein for performing certain functions on data stored in nucleic acid molecules. The present disclosure covers at least the following areas of interest: (1) data structures to provide efficient access and search of information stored in nucleic acid molecules, (2) accurate and quick reading of information stored in nucleic acid molecules, (3) targeted approaches to accessing subsets of information stored in nucleic acid molecules, (4) a rank function that determines a count of particular bit or symbol value in a set of information stored in nucleic acid molecules, (5) functions including counting, locating, and extracting occurrences of a specific pattern in a message of information stored in nucleic acid molecules, and (6) an if-then-else operation to sort data stored in nucleic acid molecules.Type: GrantFiled: May 11, 2020Date of Patent: March 21, 2023Assignee: CATALOG TECHNOLOGIES, INC.Inventors: Nathaniel Roquet, Swapnil P. Bhatia, Paolo Ferragina
-
Publication number: 20200357483Abstract: The present disclosure is directed to enabling search and extraction of data stored in DNA with optimized data structures and functions. Accordingly, systems and methods are provided herein for performing certain functions on data stored in nucleic acid molecules. The present disclosure covers at least the following areas of interest: (1) data structures to provide efficient access and search of information stored in nucleic acid molecules, (2) accurate and quick reading of information stored in nucleic acid molecules, (3) targeted approaches to accessing subsets of information stored in nucleic acid molecules, (4) a rank function that determines a count of particular bit or symbol value in a set of information stored in nucleic acid molecules, (5) functions including counting, locating, and extracting occurrences of a specific pattern in a message of information stored in nucleic acid molecules, and (6) an if-then-else operation to sort data stored in nucleic acid molecules.Type: ApplicationFiled: May 11, 2020Publication date: November 12, 2020Inventors: Nathaniel Roquet, Swapnil P. Bhatia, Paolo Ferragina
-
Patent number: 10346551Abstract: Exemplary systems, methods and computer-accessible mediums can receive first data related to at least one first string arranged in a directed acyclic graph, compress the first data into second data, and can search the second data for a match of at least one second string. A node of the directed acyclic graph can encode at least one substring, and an edge of the directed acyclic graph can encode instructions for concatenating substrings.Type: GrantFiled: January 24, 2014Date of Patent: July 9, 2019Assignee: New York UniversityInventors: Bhubaneswar Mishra, Paolo Ferragina
-
Publication number: 20150356147Abstract: Exemplary systems, methods and computer-accessible mediums can receive first data related to at least one first string arranged in a directed acyclic graph, compress the first data into second data, and can search the second data for a match of at least one second string. A node of the directed acyclic graph can encode at least one substring, and an edge of the directed acyclic graph can encode instructions for concatenating substrings.Type: ApplicationFiled: January 24, 2014Publication date: December 10, 2015Applicant: New York UniversityInventors: Bhubaneswar Mishra, Paolo Ferragina
-
Patent number: 8996622Abstract: Disclosed are methods and apparatus for detecting spam hosts. In one embodiment, one or more graphs are generated using data obtained from a query log, where the one or more graphs include at least one of an anticlick graph or a view graph. Values of one or more syntactic features of the one or more graphs are ascertained. Values of one or more semantic features of the one or more graphs are determined by propagating categories from a web directory among nodes in each of the one or more graphs. Spam hosts are then detected based upon the values of the syntactic features and the semantic features.Type: GrantFiled: September 30, 2008Date of Patent: March 31, 2015Assignee: Yahoo! Inc.Inventors: Debora Donato, Aristides Gionis, Claudio Corsi, Paolo Ferragina
-
Patent number: 8156156Abstract: A method of structuring and compressing labeled trees of arbitrary degree and shape for optimal succinctness, the method including a transform for compressing and indexing tree shaped data, using path sorting and grouping to linearize labeled tree shaped data into two coordinated arrays, one capturing the structure of the tree and the other capturing the labels of the tree. Additional navigational operations and basic searching may be performed on the transformed data.Type: GrantFiled: April 6, 2007Date of Patent: April 10, 2012Assignee: Universita di PisaInventors: Paolo Ferragina, Fabrizion Luccio, Giovanni Manzini, Shanmugavelayut Muthukrishnan
-
Publication number: 20100082752Abstract: Disclosed are methods and apparatus for detecting spam hosts. In one embodiment, one or more graphs are generated using data obtained from a query log, where the one or more graphs include at least one of an anticlick graph or a view graph. Values of one or more syntactic features of the one or more graphs are ascertained. Values of one or more semantic features of the one or more graphs are determined by propagating categories from a web directory among nodes in each of the one or more graphs. Spam hosts are then detected based upon the values of the syntactic features and the semantic features.Type: ApplicationFiled: September 30, 2008Publication date: April 1, 2010Inventors: Debora Donato, Aristides Gionis, Claudio Corsi, Paolo Ferragina
-
Publication number: 20100082694Abstract: Disclosed are methods and apparatus for detecting spam-attracting queries. In one embodiment, one or more graphs are generated using data obtained from a query log, where the one or more graphs include at least one of an anticlick graph or a view graph. Values of one or more syntactic features of the one or more graphs are ascertained. Values of one or more semantic features of the one or more graphs are determined by propagating categories from a web directory among nodes in each of the one or more graphs. Spam-attracting queries are then detected based upon the values of the syntactic features and the semantic features.Type: ApplicationFiled: September 30, 2008Publication date: April 1, 2010Inventors: Claudio Corsi, Debora Donato, Aristides Gionis, Paolo Ferragina
-
Publication number: 20090063465Abstract: An improved system and method for string processing and searching using a compressed permuterm index is provided. To build a compressed permuterm index for a string dictionary, an index builder constructs a unique string from a collection of strings of a dictionary sorted in lexicographic order and then builds a compressed permuterm index to support queries over the unique string. A dictionary query engine supports several types of wild-card queries over the string dictionary by performing a backward search modified with a CyclicLF operation over the compressed permuterm index. These queries may used to implement other queries including a membership query, a prefix query, a suffix query, a prefix-suffix query, a query for an exact or substring match, a rank query, a select query and so forth. String processing and searching tasks may accurately be performed for sophisticated queries in optimal time and compressed space.Type: ApplicationFiled: August 29, 2007Publication date: March 5, 2009Applicant: Yahoo! Inc.Inventors: Paolo Ferragina, Rossano Venturini
-
Publication number: 20070255748Abstract: A method of structuring and compressing labeled trees of arbitrary degree and shape for optimal succinctness, the method including a transform for compressing and indexing tree shaped data, using path sorting and grouping to linearize labeled tree shaped data into two coordinated arrays, one capturing the structure of the tree and the other capturing the labels of the tree. Additional navigational operations and basic searching may be performed on the transformed data.Type: ApplicationFiled: April 6, 2007Publication date: November 1, 2007Inventors: Paolo Ferragina, Fabrizion Luccio, Giovanni Manzini, Shanmugavelayut Muthukrishnan
-
Patent number: 6434566Abstract: A method and system for efficiently resolving the multi-method dispatching problem provided. The dispatching problem is reduced to geometric problems on multi-dimensional grids and new data structures are provided for the resulting geometric problems. In particular, methods having the same name are mapped to a set of rectangles based on a pair of numbers associated with each argument. The pair of numbers is an interval identifying the position of the argument in a class hierarchy tree. The interval is found by computing an Euler Tour of the class hierarchy tree. For a given method invocation in an object-oriented program, the method invocation is mapped to a point based on one of the numbers in the interval associated with each argument in the invocation. The problem of finding the most specific method for the method invocation is thus transformed into the so-called point enclosure problem in geometry, in which the smallest rectangle is found which encloses a given point.Type: GrantFiled: December 1, 1998Date of Patent: August 13, 2002Assignee: Lucent Technologies Inc.Inventors: Paolo Ferragina, Shanmugavelayut Muthukrishnan