Abstract: A method of computing a measure of similarity between nodes of first and second networks is described. In particular, sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. Thus, a pairwise score, referred to as Rij, is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The goal of this process is to identify node pairs that exhibit high Rij values. According to the technique described herein, the intuition is that nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of “network similarity.” If node feature data also is available, the intuition may be expanded such that nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Node feature data typically is domain-specific.

Abstract: A scalable infrastructure for searching multiple disparate textual databases by mapping their contents onto a structured ontology, e.g., of medical concepts. This framework can be leveraged against any database where free-text attributes are used to describe the constituent records.

Abstract: A method of computing a measure of similarity between nodes of first and second networks is described. In particular, sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. Thus, a pairwise score, referred to as Rij, is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The goal of this process is to identify node pairs that exhibit high Rij values. According to the technique described herein, the intuition is that nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of “network similarity.” If node feature data also is available, the intuition may be expanded such that nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Node feature data typically is domain-specific.

Abstract: Disclosed herein are methods and articles of manufacture for assembly of a plurality of reads from a genomic region that include the steps of indexing a plurality of read subsequences for each of a plurality of reads, extracting from the indexed subsequences a plurality of read pairs that have a predetermined number of subsequences in common, and merging the read pairs along a continuum. Also disclosed are methods and articles of manufacture for assembly of merged reads from a genomic region that include the steps of using linking information to identify one or more ambiguities in the merged reads, identifying a repeat region and a set of unique regions, and linking pairs of unique regions using the linking information associated with the reads in the unique regions.

Abstract: An antimicrobial composition containing quinolones and parabens provides surprising fungicidal and bactericidal activity when used in serum or protein-based in-vitro diagnostic kits. Also, a method of inhibiting the growth of bacteria and fungi in in-vitro diagnostic kits by adding the new antimicrobial composition to the kit components.