Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-76928-6_91 | Australian Conference on Artificial Intelligence |
Keywords | Field | DocType |
local search,structural similarity | Graph,Combinatorics,Degree of similarity,Clique,Structural similarity,Local search (optimization),Mathematics,Protein structure | Conference |
Volume | ISSN | ISBN |
4830 | 0302-9743 | 3-540-76926-9 |
Citations | PageRank | References |
6 | 0.72 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne J. Pullan | 1 | 232 | 12.73 |