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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Docking_(molecular)
dbo:wikiPageWikiLink
dbr:Katchalski-Katzir_algorithm
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.
dcterms:subject
dbc:Computational_chemistry dbc:Geometric_algorithms dbc:Molecular_modelling
dbo:wikiPageID
5198590
dbo:wikiPageRevisionID
1042831649
dbo:wikiPageWikiLink
dbr:Docking_(molecular) dbr:Hydrophobic dbr:Induced_fit dbr:Fast_Fourier_transform dbr:Convolution_theorem dbr:Molecular_modelling dbr:Hydrophilic dbc:Geometric_algorithms dbr:Ephraim_Katzir dbc:Computational_chemistry dbr:Electrostatics dbc:Molecular_modelling dbr:Electrostatic dbr:Weizmann_Institute_of_Science
owl:sameAs
yago-res:Katchalski-Katzir_algorithm freebase:m.0d7f6n n13:4pGA9 wikidata:Q6375302
dbp:wikiPageUsesTemplate
dbt:Reflist
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.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Katchalski-Katzir_algorithm?oldid=1042831649&ns=0
dbo:wikiPageLength
3475
foaf:isPrimaryTopicOf
wikipedia-en:Katchalski-Katzir_algorithm
Subject Item
dbr:Katchalski
dbo:wikiPageWikiLink
dbr:Katchalski-Katzir_algorithm
dbo:wikiPageDisambiguates
dbr:Katchalski-Katzir_algorithm
Subject Item
dbr:Katzir_(disambiguation)
dbo:wikiPageWikiLink
dbr:Katchalski-Katzir_algorithm
dbo:wikiPageDisambiguates
dbr:Katchalski-Katzir_algorithm
Subject Item
wikipedia-en:Katchalski-Katzir_algorithm
foaf:primaryTopic
dbr:Katchalski-Katzir_algorithm