Skype Limited

Protobios, LLC

Jaak Vilo

Marlon Gerardo Dumas

Konstantin Tretjakov

Abel Armas-Cervantes

Toomas Neuman

Lagle Kasak

Kaia Palm

Luciano Garcia-Bañuelos

Meelis Kull

Luciano García-Bañuelos

Balaji Rajashekar

Sulev Reisberg

Martin Sauk

Mari-Liis Kruup

Arno Pihlak

Gerli Viikmaa

Ave Kris Lend

Anri Kivil

Anti Alman

Anastassia Kolde

A method of forming a metadatabase of minimal epitope profiles including: performing antibody activity profiling from an immunoglobulin fraction of a plurality of samples to form a data set of peptide profiles for each sample, comparing peptide profiles across different samples, assigning a diagnosis or disorder to differentially expressed meta-profiles, constructing a meta-database containing minimal epitope clusters, constructing a database of peptide frequencies, aligning peptides to define the sequence of minimal epitope, verifying the minimal epitope by harboring a connected identifier, providing an enriched affinity sample, and providing a source data for metadatabase a database underlying it.

Peptide profiling and monitoring humoral immunity

A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.

Processing search queries in a network of interconnected nodes

According to an embodiment, there is provided a method of generating a data structure stored in computer memory for processing a search query in a network of interconnected nodes, wherein the method comprises selecting landmark nodes by the following steps and storing the selected landmark nodes in the data structure: sampling from the network nodes a first sample of vertex pairs, computing the shortest path for each vertex pair, each shortest path comprising a set of vertices between each vertex in the vertex pair; identifying a first landmark node which occurs in more of the shortest paths more often than any other vertex; removing from the network vertices shortest paths including the first landmark node and identifying a second landmark node which occurs in more of the remaining shortest paths than any other remaining vertex.

Processing search queries using a data structure

Growing community of inventors

Tartu, Estonia

Jaak Vilo