Protein Structure-structure Alignment with Discrete FrÉchet Distance


Matching two geometric objects in two-dimensional (2D) and three-dimensional (3D) spaces is a central problem in computer vision, pattern recognition, and protein structure prediction. In particular, the problem of aligning two polygonal chains under translation and rotation to minimize their distance has been studied using various distance measures. It is well known that the Hausdorff distance is useful for matching two point sets, and that the Fréchet distance is a superior measure for matching two polygonal chains. The discrete Fréchet distance closely approximates the (continuous) Fréchet distance, and is a natural measure for the geometric similarity of the folded 3D structures of biomolecules such as proteins. In this paper, we present new algorithms for matching two polygonal chains in two dimensions to minimize their discrete Fréchet distance under translation and rotation, and an effective heuristic for matching two polygonal chains in three dimensions. We also describe our empirical results on the application of the discrete Fréchet distance to protein structure-structure alignment.

DOI: 10.1142/S0219720008003278

Extracted Key Phrases

3 Figures and Tables


Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Jiang2007ProteinSA, title={Protein Structure-structure Alignment with Discrete Fr{\'E}chet Distance}, author={Minghui Jiang and Ying Xu and Binhai Zhu}, journal={Journal of bioinformatics and computational biology}, year={2007}, volume={6 1}, pages={51-64} }