Protein structure-structure alignment with discrete Fréchet distance

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 131-141

  Jiang, Minghui ^a   Xu, Ying ^b   Zhu, Binhai ^c  

^a Utah State University ^*  (United States)

^b University of Georgia   (United States)

^c Idaho National Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; GEOMETRY; HEURISTIC ALGORITHMS; PATTERN RECOGNITION;

CENTRAL PROBLEMS; DISTANCE MEASURE; GEOMETRIC OBJECTS; GEOMETRIC SIMILARITY; HAUSDORFF DISTANCE; PROTEIN STRUCTURE PREDICTION; PROTEIN STRUCTURES; STRUCTURE ALIGNMENT;

PROTEINS;

EID: 84863022204     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947995_0016     Document Type: Conference Paper

References (17)

1. O. Aichholzer, H. Alt, and G. Rote. Matching shapes with a reference point. International Journal of Computational Geometry & Applications, 7(4):349-363, 1997.
2. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes (extended abstract). In Proceedings of the 7th Annual Symposium on Computational Geometry (SoCG'91), pages 186-193, 1991.
3. H. Alt and M. Godau. Measuring the resemblance of polygonal curves. In Proceedings of the 8th Annual Symposium on Computational Geometry (SoCG'92), pages 102-109, 1992.
4. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry & Applications, 5:75-91, 1995.
5. H. Alt, C. Knauer, and C.Wenk.Matching polygonal curves with respect to the Fréchet distance. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS'01), pages 63-74, 2001.
6. P.K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric search in geometric optimization. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'92), pages 72-82, 1992.
7. L.P. Chew and K. Kedem. Finding the consensus shape of a protein family. In Proceedings of the 18th Annual Symposium on Computational Geometry (SoCG'02), pages 64-73, 2002.
8. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM, 34:200-208, 1987.
9. T. Eiter and H. Mannila. Computing discrete Fréchet distance. Technical Report CD-TR 94/64, Information Systems Department, Technical University of Vienna, 1994.
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
11. D.P. Huttenlocher, K. Kedem, and J.M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proceedings of the 8th Annual Symposium on Computational Geometry (SoCG'92), pages 110-119, 1992.
12. D.P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. In Proceedings of the 7th Annual Symposium on Computational Geometry (SoCG'91), pages 194-203, 1991.
13. P. Indyk. Approximate nearest neighbor algorithms for Fréchet distance via product metrics. In Proceedings of the 18th Annual Symposium on Computational Geometry (SoCG'02), pages 102-106, 2002.
14. A.Mosig andM. Clausen. Approximately matching polygonal curves with respect to the Fréchet distance. Computational Geometry: Theory and Applications, 30(2):113-127, 2005.
15. I.N. Shindyalov and P.E. Bourne. Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering, 11(9):739-747, 1998.
16. C.-R. Shyu, P.-H. Chi, G. Scott, and D. Xu. ProteinDBS: a real-time retrieval system for protein structure comparison. Nucleic Acids Research, 32:W572-575, 2004.
17. C. Wenk. Shape Matching in Higher Dimensions. PhD thesis, Freie Universitaet Berlin, 2002.