We develop a rapid and efficient method for the comparison of protein local surface similarities using geometric invariants (fingerprints). By combining fast fingerprint comparison with explicit alignment, we successfully screen the entire Protein Data Bank for proteins that possess local surface similarities. Our method is independent of sequence and fold similarities, and has potential application to protein structure annotation and protein-protein interface design. molecular surface ͉ surface matching ͉ structural genome W ith the advance of high-throughput protein-structure determination techniques and structural genome initiatives, the number of solved protein structures in the Protein Data Bank (PDB) (1) grows daily. With this trend arises the need to analyze, compare, and classify proteins using 3-dimensional (3D) structural information. Methods have been developed that can compare and classify proteins using their overall sequence and structural similarities (2-4). However, it is known that the overall sequence and fold similarities of proteins do not necessarily translate to similarities in protein function. The biological role of a protein can diverge as the protein evolves, resulting in multiple functions corresponding to the same fold (5). For example, the TIM barrel fold has evolved to possess a variety of functions (6). Conversely, proteins of different folds may acquire similar functions: for example, in trypsin-like catalytic triad (7). In such cases, the function of the protein is connected more closely to the local structural similarity around the functional site than it is to sequence. In this context, there is great need for fast and accurate methods that can compare such function-related local structural similarities.The general difficulty with local structural comparisons is the complexity associated with the additional degree of freedom for matching 3D objects. To find local structural similarities, 3D objects must undergo extensive rotational and translational transformations so that various local alignments may be sampled and differences can be measured. Such transformations impose tremendous overhead for computational methods. Although algorithmic improvements, such as subgraph-isomorphism (8), geometric hashing (9-13), Fourier transformation (FT) (14), spherical FT (15), and clique detection (16, 17) have been used to reduce the complexity of this problem, these methods are still too computationally expensive to be applied on a large database of more than 10 5 protein structures. As a result, previous studies of local structural comparisons have often been limited to predefined protein-ligand binding pockets (16-18). Using geometric hashing and a hierarchical scoring approach, complete local surface screening has been performed on a nonredundant PDB database containing 4,375 structures (11).Recently, new approaches (19,20) have emerged that can compare protein surfaces without explicit alignment. Borrowed from the computer vision field, the key idea behind these new approaches is the u...