Sentence examples for matching were defined from inspiring English sources

Donor and recipient HLA matching were defined using best available HLA-matching data.

The weight of the k-clique matching is defined as the sum of the weights of all its k-cliques.

Nearest-neighbour matching is defined by: C i =underset{j}{ min}leftVert {p}_iright.-{p}_jleftVert, right.

The degree of match is determined by the minimal distance between concepts in the taxonomy tree and four degrees of matching are defined.

Matching was defined as 10/10 fully matched.

The matching is defined on exact string equivalence.

The cost of this matching is defined to be the sum of the half-breakpoint parsimony cost of all vertices (half-breakpoints).

Confident matches were defined by the MASCOT score and statistical significance (P<0.05), the number of matching peptides and the percentage of total amino acid sequences covered by matching peptides.

Likewise, those duplicate matches were defined as incorrect links.

For spectral matching, a mass threshold and a minimum similarity match were defined.

Loose matches were defined by sequence reads that aligned with chicken miRNA consensus sequence with 1-4 mismatches.