matching

(redirected from Matching problem)
Also found in: Dictionary, Thesaurus, Financial, Encyclopedia.
Related to Matching problem: Maximum weight matching

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 ?
Efficient algorithms for the order preserving pattern matching problem. CoRR, abs/1501.04001, 2015 [flecha arriba].
We are now ready to solve the permutation pattern matching problem in case both [pi] and [sigma] are wedge permutations.
Efficient algorithms for the [delta]-approximate string matching problem in musical sequences.
The objective of the maximum weighted triple matching problem is to maximize the total weighted gains of the RSU S.
In this section, we will evaluate the performance of GPU implementation of membrane algorithms through two classical intractable problems: the point set matching problem and TSP.
The matching problem is often presented in more concrete guises.
The first one is the matching problem driven by the observation that there are many ways to match applicants to institutions of higher learning, but there are some ways of matching that are better than others.
Using a cost segregation report will help identify what type of property and how much of it should be acquired to avoid a matching problem.
In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Makinen and Navarro [Position-Restricted Substring Searching, LATIN 2006].
The maximum (cardinality) matching problem is the problem of finding a matching of maximum cardinality in a given graph.
The simplest way is to regard one to many matching problem as N time one to one matching.