FAQ

Katchalski-Katzir algorithm

Known as: Katchalski, Katzir (disambiguation) 
The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski/Katzir. It is a purely geometric… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1954-2017
02419542016

Related topics

Related topics

3 relations

Broader (1)

Computational chemistry
Docking (molecular)Molecular modelling

Related mentions per year

Related mentions per year

1955-2018
1960198020002020
Katchalski-Katzir algorithm
Docking (molecular)
Molecular modelling
Computational chemistry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Proof of a Conjecture of Bárány, Katchalski and Pach
Bárány, Katchalski and Pach (Proc Am Math Soc 86(1):109–114, 1982) (see also Bárány et al., Am Math Mon 91(6):362–365, 1984… (More)
  • figure 1
Is this relevant?
2012
2012
Viable and Fixed White Matter: DTI and Microstructural Comparisons at Physiological Temperature
We compare fixed and viable isolated tissue (VIT) in identical conditions at physiological temperature. We acquired DTI data sets… (More)
  • table 1
Is this relevant?
2007
2007
Proof of the Katchalski-Lewis Transversal Conjecture for T(3)-Families of Congruent Discs
 
Is this relevant?
2005
2005
Interaction of the Insulin Receptor with the Receptor-Like Protein Tyrosine Phosphatases PTP and PTP in Living Cells
The interactions between the insulin receptor and the two highly homologous receptor-like protein tyrosine phosphatases (PTPase… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
2005
2005
Aharon Katzir-Katchalsky
A man with a razor-sharp mind, overflowing with ideas, a man full of life. This was Aharon Katzir-Katchalsky. He was killed on… (More)
Is this relevant?
1998
1998
On constructing snakes in powers of complete graphs
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(K d mn) ≥ λmnS… (More)
Is this relevant?
1997
1997
An Upper Bound on the Size of the Snake-In-The-Box
The n-cube Qn can be considered as the graph whose vertices are indexed by the binary n-tuples and such that two vertices are… (More)
  • figure 1
  • figure 2
Is this relevant?
1990
1990
On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates
 
Is this relevant?
1989
1989
Necessary and Sufficient Conditions for Hyperplane Transversals
We will prove that a finite family <italic>B</italic> = {<italic>B</italic><subscrpt>1</subscrpt>, <italic>B</italic><subscrpt>2… (More)
Is this relevant?
1986
1986
The longest cycle of a graph with a large minimal degree
We show that every graph G on n vertices with minimal degree at least n / k contains a cycle of length at least [ n / ( k 111… (More)
Is this relevant?