matching

(redirected from Maximum matching)
Also found in: Dictionary, Thesaurus, Financial, Encyclopedia.

matching

 [mach´ing]
1. comparison and selection of objects having similar or identical characteristics.
2. the selection of compatible donors and recipients for transfusion or transplantation. See also typing.
3. the selection of subjects for clinical trials or other studies so that the different groups being compared are similar in specified characteristics, e.g., age, sex, or race, in order to reduce bias caused by comparison of dissimilar groups. Matching may be on an individual (matched pairs) or a group-wide basis.
cross matching crossmatching.

match·ing

(match'ing),
The process of making a study group and a comparison group in an epidemiologic study comparable with respect to extraneous or confounding factors such as age, gender, and weight.

matching

EBM
The grouping of individuals or groups by researchers based on particular variables thought to be important (such as gender or age). In a case-control study, if the controls are chosen because of particular similarities to the people who are in the case group, the cases and controls are said to be “matched”.

Social medicine
The attempt to select adoptive parents similar to the child being adopted, as in appearance, interests, intelligence, personality or other traits, so as to achieve the best outcome for the adoption.

matching

Clinical trials A process by which a study group and comparison group are 'equalized' with respect to factors viewed as extraneous to the study's central questions, that might interfere with interpreting data on study completion. See Case-control study. Cf Match.

match·ing

(mach'ing)
The process of making a study group and a comparison group in an epidemiologic study comparable with respect to extraneous or confounding factors such as age, sex, and weight.

match·ing

(mach'ing)
Process of making a study group and a comparison group in an epidemiologic study comparable with respect to extraneous or confounding factors.

Patient discussion about matching

Q. Hi members, after I notice that our symptoms match those of fibromyalgia. Hi members, after I notice that our symptoms match those of fibromyalgia, do we have to live with it and simply manage it for the rest of our life or try some luck with food and meds? Thanks.

A. If you could have given a particular age details then it could have been easy to analyze. This condition is relatively new, yet it's appearing in epidemic numbers. Dr. Whiting (an orthomolecular nutritionist), finds in his work with people suffering with this that they are all very toxic. When their systems have been properly detoxified their symptoms will disappear. His personal feeling is that this is a condition of hyper-toxicity and manifests itself in people who are unable to physically cope with the overload of toxins in their system.

More discussions about matching
References in periodicals archive ?
Because the transfer stations connect two or more lines, there are more nonmatching nodes around transfer stations according to the maximum matching theory.
Karp, "An n5/2 algorithm for maximum matchings in bipartite graphs," SIAM Journal on Computing, vol.
We first generalize the concepts of geometric multiplicity of an eigenvalue, matching, and maximum matching in an undirected graph (in a digraph) and its bipartite representation (see [20]).
For an undirected graph, a maximum matching [M.sup.*] is a matching of maximum-cardinality among all matchings.
Similarly, we consider the cases in a digraph and give the definitions of a matching and maximum matching of a digraph and its bipartite representation.
For a digraph, a matching of maximumcardinality is called a maximum matching, symbolized by [M.sup.*.sub.D].
Denote [absolute value of ([M.sup.*.sub.D])] as the size of the maximum matching [M.sup.*.sub.D] in [G.sub.D].
For the maximum matching of a digraph, a simple algorithm based on bipartite graph is described below.
If HL1 is run on [K.sub.n], the maximum matching found in its complement [K.sub.n] has [n/2\ edges, and the time taken to find it is c'[bar.m], where c is a constant independent of n and m = |E([[bar.K].sub.n])|.
Tzeng and King's algorithm [26] includes a step that finds a maximum matching in [bar.G].
An 0([MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]) algorithm for finding maximum matching in general graphs.
An [n.sup.5/2] algorithm for maximum matchings in bipartite graphs.

Full browser ?