Enzyme kineticsEnzyme kinetics is the study of the rates of enzyme-catalysed chemical reactions. In enzyme kinetics, the reaction rate is measured and the effects of varying the conditions of the reaction are investigated. Studying an enzyme's kinetics in this way can reveal the catalytic mechanism of this enzyme, its role in metabolism, how its activity is controlled, and how a drug or a modifier (inhibitor or activator) might affect the rate. An enzyme (E) is typically a protein molecule that promotes a reaction of another molecule, its substrate (S).
Competitive inhibitionCompetitive inhibition is interruption of a chemical pathway owing to one chemical substance inhibiting the effect of another by competing with it for binding or bonding. Any metabolic or chemical messenger system can potentially be affected by this principle, but several classes of competitive inhibition are especially important in biochemistry and medicine, including the competitive form of enzyme inhibition, the competitive form of receptor antagonism, the competitive form of antimetabolite activity, and the competitive form of poisoning (which can include any of the aforementioned types).
Enzyme inhibitorAn enzyme inhibitor is a molecule that binds to an enzyme and blocks its activity. Enzymes are proteins that speed up chemical reactions necessary for life, in which substrate molecules are converted into products. An enzyme facilitates a specific chemical reaction by binding the substrate to its active site, a specialized area on the enzyme that accelerates the most difficult step of the reaction.
Glucose meterA glucose meter, also referred to as a "glucometer", is a medical device for determining the approximate concentration of glucose in the blood. It can also be a strip of glucose paper dipped into a substance and measured to the glucose chart. It is a key element of glucose testing, including home blood glucose monitoring (HBGM) performed by people with diabetes mellitus or hypoglycemia. A small drop of blood, obtained from slightly piercing a fingertip with a lancet, is placed on a disposable test strip that the meter reads and uses to calculate the blood glucose level.
Blood glucose monitoringBlood glucose monitoring is the use of a glucose meter for testing the concentration of glucose in the blood (glycemia). Particularly important in diabetes management, a blood glucose test is typically performed by piercing the skin (typically, via fingerstick) to draw blood, then applying the blood to a chemically active disposable 'test-strip'. The other main option is continuous glucose monitoring (CGM). Different manufacturers use different technology, but most systems measure an electrical characteristic and use this to determine the glucose level in the blood.
Worst-case complexityIn computer science (specifically computational complexity theory), the worst-case complexity measures the resources (e.g. running time, memory) that an algorithm requires given an input of arbitrary size (commonly denoted as n in asymptotic notation). It gives an upper bound on the resources required by the algorithm. In the case of running time, the worst-case time complexity indicates the longest running time performed by an algorithm given any input of size n, and thus guarantees that the algorithm will finish in the indicated period of time.
Best, worst and average caseIn computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or some other resource. Best case is the function which performs the minimum number of steps on input data of n elements. Worst case is the function which performs the maximum number of steps on input data of size n.
Average-case complexityIn computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. It is frequently contrasted with worst-case complexity which considers the maximal complexity of the algorithm over all possible inputs. There are three primary motivations for studying average-case complexity.
