Abstract: A system may receive a dynamic network graph and select an origination node. From the origination node, the system may deploy a random walk simulation on the dynamic network graph simulating steps from the origination node to one or more other nodes, and determine a convergence node for the random walk simulation.

Abstract: A computer-implemented method for generating a cover set of biological sequences to detect a group of biological members. The method includes one or more computer processors receiving a request to generate a cover set of k-mers used to detect a first group of biological members that are related via a taxonomic lineage. The method further includes obtaining a plurality of biological sequence data corresponding to biological members of the first group. The method further includes determining a set of k-mers respectively associated with a biological member included within the first group of biological members. The method further includes determining the cover set of k-mers utilized to detect the biological members of the first group by selecting a subset of k-mers from a superset of k-mers associated with the first group of biological members based on preventing false-positive detections of biological members different from the first group of biological members.

Abstract: A computer-implemented method includes receiving genomic data associated with a plurality of genomes and identifying k-mer sets within the genomic data. The method includes constructing a k-mer subset tree according to the following process: performing iterative pairwise comparisons on the k-mer sets, wherein the iterative pairwise comparisons identify fragments with the most shared k-mers, merging the identified fragments into non-leaf nodes of the k-mer subset tree, and placing each remaining k-mer into a leaf node of the k-mer subset tree. The method includes storing the k-mer subset tree. A computer program product for data compression includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a computer to cause the compute to perform the foregoing method. A system includes a processor and logic. The logic is configured to perform the foregoing method.

Abstract: A computer-implemented method includes receiving genomic data associated with a plurality of genomes and identifying k-mer sets within the genomic data. The method includes constructing a k-mer subset tree according to the following process: performing iterative pairwise comparisons on the k-mer sets, wherein the iterative pairwise comparisons identify fragments with the most shared k-mers, merging the identified fragments into non-leaf nodes of the k-mer subset tree, and placing each remaining k-mer into a leaf node of the k-mer subset tree. The method includes storing the k-mer subset tree. A computer program product for data compression includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a computer to cause the compute to perform the foregoing method. A system includes a processor and logic. The logic is configured to perform the foregoing method.