Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (1)

Computational chemistry
Docking (molecular)Molecular modelling

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
  • M. Naszódi
  • Discret. Comput. Geom.
  • 2016
  • Corpus ID: 206998268
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… 
2011
2011
Ephraim Katzir-Katchalski
16 MAY 1916 * 30 MAY 2009EPHRAIM KATZIR-KATCHALSKI dedicated his life to science and to the State of Israel, all within the frame… 
2011
2011
A Tur'an-type problem for circular arc graphs
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem… 
2008
2008
Common transversals in the plane: The fractional perspective
2007
2007
Proof of the Katchalski-Lewis Transversal Conjecture for T(3)-Families of Congruent Discs
  • A. Heppes
  • Discret. Comput. Geom.
  • 2007
  • Corpus ID: 32546446
A family of disjoint closed congruent discs is said to have property T(3) if to every triple of discs there exists a common line… 
2003
2003
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls
Abstract. Let F be a family of disjoint unit balls in R3 . We prove that there is a Helly-number n0≤ 46 , such that if every n0… 
1997
1997
An upper bound on the size of the snake-in-the-box
A snake in a graph is a simple cycle without chords. We give an upper bound on the size of a snake S in then-dimensional cube of… 
1989
1989
Necessary and sufficient conditions for hyperplane transversals
We prove that a finite family ℬ={B1,B2, ...,Bn} of connected compact sets in ℝd has a hyperplane transversal if and only if for… 
1986
1986
The longest cycle of a graph with a large minimal degree
  • N. Alon
  • J. Graph Theory
  • 1986
  • Corpus ID: 206079422
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 − 1)]. This… 
1955
1955
Inhibition, Restoration and Enhancement of Proteolytic Action by Polylysine and Polyglutamic Acid
POLYELECTROLYTES of high molecular weight have been shown to inhibit a variety of enzymes in what Spensley and Rogers1 have… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)