Sentence examples for match coefficient from inspiring English sources

To estimate pairwise genetic similarity for this study, we used the simple match coefficient (s), which Kosman & Leonard [55] argue is the most appropriate index for polyploid species, to calculate genetic similarity (the number of matches, in terms of shared absence or presence of a DNA fragment, divided by the total number of possible matches).

The tissue match coefficient (tiss) in Table  4 indicates the impact of a 1% difference in 12 month kidney survival.

The custom R function inputted SNP genotype data for different groups, took into account missing data (if any) to calculate similarity using simple match coefficient (Sokal and Michener 1958), and converted those similarity values into a dissimilarity distance matrix.

Co-operativity coefficients estimated this way closely match coefficients derived by recording from several Ca2+ concentrations in single cells giving coefficients of ∼3 4 in wild-type larvae.

The quantities λ and q, satisfying the above matching equation, are called the matching coefficient and mode, respectively.

The similarity between morpho-types resulted in phenogram was estimated by simple matching coefficient (SM).

Wu et al. [7] also state that it is a common practice to use Jaccard coefficient for sparse data instead of simple matching coefficient.

This paper presents a decision-making method called matching coefficient model for supporting these less-developed townships to identify suitable development orientations in order to attract effective investments.

Matching coefficient is a very simple vector based approach which simply counts the number of similar terms (dimensions), with which both vectors are non-zero.

If we aim to optimize the anti-Robinson function with simple matching coefficient, 2D sort returns the best results for both matrices.

If we desire to optimize the anti-Robinson function with simple matching coefficient, the choices are almost the inverse of the previous situation:  If we desire to optimize the anti-Robinson function with simple matching coefficient, the choices are almost the inverse of the previous situation: – For 100 × 100 matrices, the 2D sort returns the best results (and in lower time than Sugiyama).