Sentence examples for mutual graph from inspiring English sources

A mutual graph cut-based minimization method is developed to minimize the energy pairs.

A mutual graph cut-based minimization method is developed to minimize the energy pairs.  .

A mutual information graph was constructed with vertices that corresponded to TM positions and edges between vertices were drawn if the mutual information exceeded a threshold of statistical significance.

Then three mutual edges between graph (A) and graph (B): c d, c e, and e d are picked as shown in Figure 5 ( D).

The seven unique edges on the mutual vertices between graph (A) and (B) are shown in Figure 5 ( C).

We propose a generic algorithm that identifies a cohort of correlated positions on the basis of mutual information and graph theory from any MSA of AA residues (this algorithm can be modified to incorporate nucleotide sequences).

Using a novel algorithm based on mutual information and graph theory, we identified a clique of non-conserved positions in the 7-TM alignment of GPCRs that have a high degree of connectivity to other positions with respect to MI, i.e. high degree, high MI cohort.

Additionally, the kth total (or local-fragment) mutual probability (MP) graph-theoretical electronic-density matrix (MP-GEDM, (_{(F)} {boldsymbol{mathcal{M}}}_{mp}^{k})) and edge-adjacency matrix (MP-EAM, (_{(F)} {boldsymbol{mathcal{E}}}_{{varvec{mp}}}^{k})) are introduced.

Objects are then represented by means of a graph expressing mutual relationships between such clusters.

In the case of LDPC codes applied to two correlated sources transmitted over a GMAC and decoded by using a combined factor graph, the mutual information updates through CBV nodes and PCF nodes can be analytically computed as in the case of single-user LDPC codes.

For example, COGs (Cluster of Orthologous Groups, [ 7]) are built from cliques of size 3 in the graph of mutual best cross-species BLAST hits.