Fast detection of common geometric substructure in proteins

Authors:
L. Paul Chew;Dan Huttenlocher;Klara Kedem;Jon Kleinberg
Affiliations:
Department of Computer Science, Cornell University, Ithaca NY;Department of Computer Science, Cornell University, Ithaca NY;Department of Computer Science, Cornell University, Ithaca NY 14853, and Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Computer Science, Cornell University, Ithaca NY
Venue:
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Year:
1999

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
3-D Substructure Matching in Protein Molecules

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching

Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Parallel algorithms for mining frequent structural motifs in scientific data

Proceedings of the 18th annual international conference on Supercomputing
Finding Frequent Patterns in a Large Sparse Graph*

Data Mining and Knowledge Discovery
Discovering frequent geometric subgraphs

Information Systems
Protein conformational flexibility analysis with noisy data

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology

Hi-index	0.00