By Topic

Efficient and robust three-dimensional pattern matching algorithms using hashing and dynamic programming techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Akutsu, T. ; Mech. Eng. Lab., Ibaraki, Japan

The paper presents two algorithms for the pattern matching of three-dimensional protein structures. The first of these algorithms, named the least-squares hashing method, was developed for fast substructure search amongst multiple structures. The hashing technique, which is well known in computer science, is combined with a least-squares fitting technique. The second of these algorithms, named the dynamic matching method, was developed to find the alignment of two protein structures. The dynamic matching method is a combination of a dynamic programming technique and a least-squares technique. The dynamic programming technique is applied in terms of not only local similarities but also global similarities. These algorithms have been implemented and applied to PDB data.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:5 )

Date of Conference:

4-7 Jan. 1994