“Katchalski-Katzir algorithm”的意思、由来-开放百科全书

The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski-Katzir, Isaac Shariv and Miriam Eisenstein.^[1]^[2]

In 1990 Professor Ephraim Katchalski-Katzir, former president of the state of Israel, gathered a group of physicists, chemists and biologists at the Weizmann Institute of Science, to discuss intermolecular recognition. One of the outcomes of these discussions was the Katchalski-Katzir Algorithm, proposed by Dr. Isaac Shariv, a physics PhD student at the time. The Algorithm was implemented in a computer program, MolFit, by Dr. Miriam Eisenstein from the department of Structural Chemistry.

It is a purely geometric algorithm, but some extensions of it also implement electrostatics.

The algorithm's first step is mapping the molecules onto grids, with each point of a grid being marked as either:

The algorithm increases the surface contact and minimizes volume overlap. It is straightforward to compute such a score for a single alignment, but there are too many possible ways to align the molecules to simply iterate over them all.

To compute the scores for many alignments efficiently, fast Fourier transform (FFT) is applied to both grids. Having the grids in FFT form lets the scoring to be computed for many different alignments very quickly.

The Katchalski-Katzir algorithm is a fast but rather limited algorithm. It is usually used to quickly filter out the obviously wrong candidate structures. A structure may have good Katchalski-Katzir score (that is, fits well geometrically), but be a very bad fit overall, for example due to unfavourable electrostatic interactions or hydrophobic and hydrophilic groups facing each other. This is not a serious problem, as such structures can be filtered out later. A bigger issue is when a favourable structure is rejected by the algorithm. Some cases where this may happen include bad geometric fit being overcome by very strong attractive forces, or where the shape of the target changes because of the interactions (induced fit).

Programs that implement the Katchalski-Katzir algorithm include MolFit^[3] and FTDock.^[4]

See also

References

1. ^{{cite book |title=A Life’s Tale |first=Ephraim |last=Katzir |publisher=Carmel Publishing House |date=2009 |edition=English language |isbn=978-965-540-026-7 |chapter=Chapter 33}}
2. ^{{cite journal |vauthors=Katchalski-Katzir E, Shariv I, Eisenstein M, Friesem AA, Aflalo C, Vakser IA |year=1992 |title=Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques |journal=Proc Natl Acad Sci USA |volume=89 |pages=2195–2199 |pmid=1549581 |doi=10.1073/pnas.89.6.2195 |pmc=48623|bibcode=1992PNAS...89.2195K }}
3. ^{{cite web |url= http://www.weizmann.ac.il/Chemical_Research_Support/molfit/ |title=MolFit |publisher=Weizmann Institute of Science |accessdate=22 February 2018}}
4. ^{{cite web |url=http://www.sbg.bio.ic.ac.uk/docking/ftdock.html |title=FTDock (v2.0) |publisher=Structural Bioinformatics Group |accessdate=22 February 2018}}