This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n14	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Katchalski-Katzir_algorithm

rdf:type

dbo:Software

rdfs:label

Katchalski-Katzir algorithm

rdfs:comment

The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski-Katzir, Isaac Shariv and Miriam Eisenstein. 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.

owl:sameAs

freebase:m.0d7f6n yago-res:Katchalski-Katzir_algorithm

dbp:wikiPageUsesTemplate

dbt:Reflist

dct:subject

dbc:Molecular_modelling dbc:Computational_chemistry dbc:Geometric_algorithms

gold:hypernym

dbr:Algorithm

prov:wasDerivedFrom

n14:Katchalski-Katzir_algorithm?oldid=1042831649&ns=0

dbo:wikiPageID

5198590

dbo:wikiPageLength

3475

dbo:wikiPageRevisionID

1042831649

dbo:wikiPageWikiLink

dbr:Fast_Fourier_transform dbc:Geometric_algorithms dbr:Hydrophile dbr:Hydrophobe dbr:Ephraim_Katzir dbc:Molecular_modelling dbr:Enzyme_catalysis dbr:Weizmann_Institute_of_Science dbr:Convolution_theorem dbr:Docking_(molecular) dbr:Molecular_modelling dbc:Computational_chemistry dbr:Electrostatics

dbo:abstract

The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski-Katzir, Isaac Shariv and Miriam Eisenstein. 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: * outside the molecule * on the molecule's surface * inside the molecule 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 and FTDock.

foaf:isPrimaryTopicOf

n14:Katchalski-Katzir_algorithm