RAPID

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. Akutsu. On determining the congruence of point sets in higher dimensions. Lecture Notes in Computer Science 834, page 38.
	2	Tatsuya Akutsu , Magnús M. Halldórsson, On the Approximation of Largest Common Subtrees and Largest Common Point Sets, Proceedings of the 5th International Symposium on Algorithms and Computation, p.405-413, August 25-27, 1994
	3	Tatsuya Akutsu , Hisao Tamaki , Takeshi Tokuyama, Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets, Proceedings of the thirteenth annual symposium on Computational geometry, p.314-323, June 04-06, 1997, Nice, France [doi>10.1145/262839.262989]
	4	H. AIt and L. Guibas. Discrete Geometric Shapes; Matching, Interpolation and Approximation, A survey. Manuscript 1996.
	5	Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl, Congruence, similarity and symmetries of geometric objects, Discrete & Computational Geometry, v.3 n.3, p.237-256, Jan., 1988 [doi>10.1007/BF02187910]
	6	K. S. Arun , T. S. Huang , S. D. Blostein, Least-squares fitting of two 3-D point sets, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.9 n.5, p.698-700, Sept. 1987 [doi>10.1109/TPAMI.1987.4767965]
	7	M. D. Atkinson, An optimal algorithm for geometrical congruence, Journal of Algorithms, v.8 n.2, p.159-172, June 1987 [doi>10.1016/0196-6774(87)90036-8]
	8	L. Balbes, S. Mascarella, and D. Boyd. A perspective of modem methods in computer-aided drug design. In K. Lipkowitz and D. B. Boyd, editors, Reviews in Computational Chemisto', volume 5, pages 337-370. VCH Publishers, 1994.
	9	D. Barnum, J. Greene, A. Smellie, and E Sprague. Identification of common functional components among molecules. To appear in J. Chem. In.#'. Comput. Sci., 1996.
	10	J. Blaney and S. Dixon. A good ligand is hard to find: Automated docking methods. Perspectives in Drug Discovery and Design, 1:301-319, 1993.
	11	D. B. Boyd. Aspects of molecular modeling. In K. Lipkowitz and D. B. Boyd, editors, Reviews in Computational Chemistr3', volume 1, pages 321-351. VCH Publishers, 1990.
	12	Richard Peirce Brent, Algorithms for finding zeros and extrema of functions without calculatingderivatives, 1971
	13	Coen Bron , Joep Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, v.16 n.9, p.575-577, Sept. 1973 [doi>10.1145/362342.362367]
	14	G. Chang, W. Guida, and W. Still. An internal coordinate montecarlo method for searching conformational space. J. Am. Chem. Soc., 111:4379--4386, I989.
	15	Moses Charikar , Chandra Chekuri , Tomás Feder , Rajeev Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.626-635, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258657]
	16	Kenneth L. Clarkson , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir , Emo Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete & Computational Geometry, v.5 n.2, p.99-160, 1990 [doi>10.1007/BF02187783]
	17	G. Crippen and 1". Havel Distance Geometry and Molecular Conformation. Research Studies Press, Letchworth, U.K., 1988.
	18	K. Dill. Folding proteins: Finding a needle in a haystack. Current Opinion in Structural Biology, 3:99-103, 1993.
	19	D. Dobkin and R. Lipton. Multidimensional search problems. SlAM J. Computing 5:181-186(1976).
	20	Paul W. Finn , Dan Halperin , Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Christian R. Shelton , Suresh Venkatasubramanian, Geometric Manipulation of Flexible Ligands, Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering, p.67-78, May 27-28, 1996
	21	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	22	A. K. Ghose , E. P. Jaeger , P. J. Kowalczyk , M. L. Peterson , A. M. Treasurywala, Conformational searching methods for small molecules I: study of the SYBYL SEARCH method, Journal of Computational Chemistry, v.14 n.9, p.1050-1065, Sept. 1993 [doi>10.1002/jcc.540140907]
	23	R. Glen, G. Martin, A. Hill, R. Hyde, P. Wollard, J. Salmon, J. Buckingham, and A. Robertson. Computer-aided design and synthesis of 5-substituted tryptamines and their pharmacology at the 5 - HTIo receptor:. Discovery of compounds with potential anti-migraine properties. J. of Medical Chemistry., 38:3566- 3580, 1995.
	24	N. Go and H. Scherga. Ring closure and local conformational deformations of chain molecules. Macromolecules, 3(2):178- ! 87, 1970.
	25	T. E Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
	26	Wayne C. Guida , Regine S. Bohacek , Mark D. Erion, Probing the conformational space available to inhibitors in the thermolysin active site using Monte Carlo/energy minimization techniques, Journal of Computational Chemistry, v.13 n.2, p.214-228, March 1992 [doi>10.1002/jcc.540130213]
	27	Dan Halperin , Christian R. Shelton, A perturbation scheme for spherical arrangements with application to molecular modeling, Proceedings of the thirteenth annual symposium on Computational geometry, p.183-192, June 04-06, 1997, Nice, France [doi>10.1145/262839.262955]
	28	A. Itai, N. Tomioka, M. Yamada, A. Inoue, and Y. Kato. Molecular superposition for rational drug design. In Kubingi, editor, 3D QSAR in Drug Design: Theoo', Methods, and Applications. ESCOM, 1995.
	29	Lydia E. Kavraki, Random networks in configuration space for fast path planning, Stanford University, Stanford, CA, 1995
	30	Sanjeev Khanna , Rajeev Motwani , Frances F. Yao, Approximation Algorithms for the Largest Common Subtree Problem., Stanford University, Stanford, CA, 1995
	31	G. Klebe and T. Mietzener. A fast and efficient method to generate biologically relevant conformations. J. of Computer-Aided Molecular Design, 8:583-606, 1994.
	32	A. Leach. A survey of methods for searching the conformational space of small and medium sized molecules. In K. Lipkowitz and D. Boyd, editors, Reviews in Computational Chemistry, volume 2, pages 1-47. VCH Publishers, 1991.
	33	T. Lengauer. Algorithmic research problems in molecular bioinformatics. In IEEE Proc. of the 2nd Israeli Symposium on the Theory of Computing and Systems, pages 177-192, 1993.
	34	M. Lipton and W. Still. The multiple minimum problem in molecular modeling: Tree searching internal coordinate conformational space. J. of Computational Chemistr)', 9(4):343-355, 1988.
	35	T. Lybrand. Computer simulation ofbiomolecular systems using molecular dynamics and free energy perturbation methods. In K. Lipkowitz and D. B. Boyd, editors, Reviews in Computational Chemistry, volume 1, pages 295-320. VCH Publishers, I990.
	36	D. Manocha, Y. Zhu, and W. Wright. Conformational analysis of molecular chains using nano-kinematics. Computer Application of Biological Sciences (CABIOS), 11(1):71-86, 1995.
	37	Y. Martin, M. Bures, E. Danaher, J. DeLazzer, and I. Lico. A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists. In J. of Computer- Aided Molecular Design, volume 7, pages 83-102, 1993.
	38	Y. C. Martin, M. G. Bures, and P. Willet. Searching databases of three-dimensional structures. In K. Lipkowitz and D. B. Boyd, editors, Reviews in Computational Chemistry, volume 1, pages 213-256. VCH Publishers, i 990.
	39	Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
	40	D A Pierre, Optimization theory with applications, Dover Publications, Inc., New York, NY, 1986
	41	Sandy Irani , Prabhakar Raghavan, Combinatorial and experimental results for randomized point matching algorithms, Proceedings of the twelfth annual symposium on Computational geometry, p.68-77, May 24-26, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237218.237240]
	42	P. J. Rezende and D. T. Lee. Point set pattern matching in ddimensions. Algorithmica, 13,387-404, 1995.
	43	A. Smellie, S. Kahn, and S. Teig. Analysis of conformational coverage: 1. validation and estimation of coverage. J. Chem. Inf. Comput. Sci., 35:285-294, 1995.
	44	P. Willet. Searching for pharmacophoric patterns in databases of three-dimensional chemical structures. J. of Molecular Recognition, 8:290-303, 1995.

Collaborative Colleagues:

P. W. Finn: colleagues

L. E. Kavraki: colleagues

J.-C. Latombe: colleagues

R. Motwani: colleagues

C. Shelton: colleagues

S. Venkatasubramanian: colleagues

A. Yao: colleagues