Sentence examples for minimum tree algorithm from inspiring English sources

We used the Steiner minimum tree algorithm [9] to search for subnetworks in the human PPI network to highlight genes of interest.

Starting with two gene sets (i.e., CNV-genes and HuGE-genes), we first constructed subnetworks for either gene set by incorporating an established human interactome and implementing a Steiner minimum tree algorithm.

The constructed CNV-subnetwork using the Steiner minimum tree algorithm contains two types of nodes: 149 are of CNV-genes that could be connected using the Steiner tree algorithm, and 126 were additionally recruited in the process of subnetwork construction.

GenRev is a recently developed software tool which implements the Steiner minimum tree algorithm, as well as two other popular algorithms for subnetwork construction.

Solving the Steiner minimum tree algorithm was proposed by Klein and Ravi [ 36], which can be used for constructing a connected subnetwork given a list of query nodes.

To construct a MDD-specific subnetwork, we applied the Steiner minimum tree algorithm that is implemented in our software framework GenRev [ 35] to the 151 DEPgenes.

Minimum spanning tree algorithm was used to construct a minimum spanning tree (MST) to determine phylogenetic pattern.

A minimum spanning tree algorithm is utilized to determine the configuration of minimum power losses along with a GA for optimal capacitor placement.

Then, it uses a minimum spanning tree algorithm to find the realizations of linear transforms with differences that have the minimum cost and replaces the linear transforms with the required differences.

The smallest subgroup of individuals having the most informative regular genotypes are efficiently determined by the minimum tree intersection algorithm.

They are the shortest path-based algorithm, the minimum spanning tree algorithm, and the broadcast/multicast incremental power (MIP) algorithm.