Protein structure alignment using maximum cliques and local search

Loading...
Thumbnail Image
File version
Author(s)
Pullan, W
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

M.A.Orgun, J. Thornton

Date
2007
Size

70024 bytes

13638 bytes

File type(s)

application/pdf

text/plain

Location

Gold Coast, Australia

License
Abstract

The protein structure alignment problem addresses the question of measuring the degree of similarity, in three-dimensional structure, of two proteins. The representation of each protein using a simple contact map allows the correspondence graph for the protein pair to be generated and the maximum clique within this graph provides a measure of the structural similarity between the two proteins. This study uses a recently developed maximum clique algorithm, Phased Local Search (PLS), to locate the maximum cliques within correspondence graphs.

Journal Title
Conference Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Book Title
Edition
Volume

4830 LNAI

Issue
Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2007 Springer. The original publication is available at www.springerlink.com This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.

Item Access Status
Note
Access the data
Related item(s)
Subject

Information and computing sciences

Persistent link to this record
Citation