Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,505 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
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.
2011
2011
A Tur'an-type problem for circular arc graphs
Rosalie Carlson
,
Stephen Flood
,
Kevin O'Neill
,
F. Su
arXiv.org
2011
Corpus ID: 18101023
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem…
Expand
2011
2011
Ephraim Katzir-Katchalski
Michael Sela
2011
Corpus ID: 107830728
16 MAY 1916 * 30 MAY 2009EPHRAIM KATZIR-KATCHALSKI dedicated his life to science and to the State of Israel, all within the frame…
Expand
2008
2008
Common transversals in the plane: The fractional perspective
J. Eckhoff
European journal of combinatorics (Print)
2008
Corpus ID: 34104429
2008
2008
Colourful transversal theorems
D. Oliveros
,
L. Montejano
Contributions Discret. Math.
2008
Corpus ID: 15070321
We prove the colourful versions of three clasical transversal theorems: The Katchalski-Lewis Theorem "T(3) implies T-k", the "T(3…
Expand
2007
2007
Proof of the Katchalski-Lewis Transversal Conjecture for T(3)-Families of Congruent Discs
A. Heppes
Discrete & Computational Geometry
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…
Expand
2003
2003
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls
Andreas F. Holmsen
,
M. Katchalski
,
T. Lewis
Discrete & Computational Geometry
2003
Corpus ID: 38499303
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…
Expand
1997
1997
An upper bound on the size of the snake-in-the-box
G. Zémor
Comb.
1997
Corpus ID: 1287549
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…
Expand
1989
1989
Necessary and sufficient conditions for hyperplane transversals
R. Pollack
,
R. Wenger
SCG '89
1989
Corpus ID: 15808292
We prove that a finite family ℬ={B1,B2, ...,Bn} of connected compact sets in ℝd has a hyperplane transversal if and only if for…
Expand
Highly Cited
1974
Highly Cited
1974
Dynamic patterns of brain cell assemblies : a report based on an NRP work session held May 14-16, 1972, and updated by participants : Aharon Katzir Katchalsky and Vernon Rowland, co-chairmen : report
Vernon Cecil Rowland
,
Robert. Blumenthal
1974
Corpus ID: 202873096
"First published as volume 12, no. 1, March 1974, of the Neurosciences Research Program bulletin." Includes index.
1955
1955
Inhibition, Restoration and Enhancement of Proteolytic Action by Polylysine and Polyglutamic Acid
E. E. Dellert
,
M. A. Stahmann
Nature
1955
Corpus ID: 4211439
POLYELECTROLYTES of high molecular weight have been shown to inhibit a variety of enzymes in what Spensley and Rogers1 have…
Expand
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)
ACCEPT & CONTINUE