The Inhibitor Index
The Inhibitor Index

Author: Daniel Purich

Publisher: CRC Press

Published: 2017-07-20

Total Pages: 1362

ISBN-13: 1351730681

DOWNLOAD EBOOK

Metabolic inhibitors and receptor antagonists are indispensable tools for the molecular life scientist. By blocking specific enzymes or receptor-mediated signal transduction cascades, they simplify the analysis of complex cellular processes especially when it is essential to demonstrate that a process of interest is functionally linked to a particular enzyme or receptor. From antibiotics to statins, modern medicine relies on the reliability and ease-of-use of enzyme- and receptor-directed inhibitors and antagonists.The Inhibitor Index is a comprehensive, curated compendium of over 7,800 enzyme inhibitors and receptor antagonists, including many toxins, poisons, and metabolic uncouplers.

Sacramental Life Volume 14.3
Sacramental Life Volume 14.3

Author: Martha Sterne

Publisher: OSL Publications

Published: 2002-05-19

Total Pages: 55

ISBN-13:

DOWNLOAD EBOOK

Sacramental Life Volume 14.3 (Summer 2002) Founded in 1988, Sacramental Life is one of two journals published by the Order of Saint Luke (OSL Publications). It focuses on the emerging and historical practices of Christian worship. Print distribution is to the members of the Order globally, as well as to a number of theology departments and seminary libraries in the United States.

Cliques, Coloring, and Satisfiability
Cliques, Coloring, and Satisfiability

Author: David S. Johnson

Publisher: American Mathematical Soc.

Published: 1996-01-01

Total Pages: 674

ISBN-13: 9780821870723

DOWNLOAD EBOOK

The purpose of a DIMACS Challenge is to encourage and coordinate research in the experimental analysis of algorithms. The First DIMACS Challenge encouraged experimental work in the area of network flow and matchings. This Second DIMACS Challenge, on which this volume is based, took place in conjunction with the DIMACS Special Year on Combinatorial Optimization. Addressed here are three difficult combinatorial optimization problems: finding cliques in a graph, colouring the vertices of a graph, and solving instances of the satisfiability problem. These problems were chosen both for their practical interest and because of their theoretical intractability.