z-logo
open-access-imgOpen Access
Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm.
Author(s) -
Bahadur K C Dukka,
Tatsuya Akutsu,
Etsuji Tomita,
Tomokazu Seki,
Asao Fujiyama
Publication year - 2002
Publication title -
genome informatics. international conference on genome informatics
Language(s) - English
DOI - 10.11234/gi1990.13.143
We developed maximum clique-based algorithms for spot matching for two-dimensional gel electrophoresis images, protein structure alignment and protein side-chain packing, where these problems are known to be NP-hard. Algorithms based on direct reductions to the maximum clique can find optimal solutions for instances of size (the number of points or residues) up to 50-150 using a standard PC. We also developed pre-processing techniques to reduce the sizes of graphs. Combined with some heuristics, many realistic instances can be solved approximately.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom