Journal of Algorithms
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Structural alignment of large—size proteins via lagrangian relaxation
Proceedings of the sixth annual international conference on Computational biology
Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology
Computing Largest Common Point Sets under Approximate Congruence
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Graph Theory With Applications
Graph Theory With Applications
Finding Largest Well-Predicted Subset of Protein Structure Models
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Improved Algorithms for Matching r-Separated Sets with Applications to Protein Structure Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 5.23 |
In this paper we study the protein structure comparison problem where each protein is modeled as a sequence of 3D points, and a contact edge is placed between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective of maximizing either (A) the size of the subsets (the LCP problem), or (B) the number of edges that exist simultaneously in both subsets (the CMO problem), under the requirement that only points within a specified proximity can be matched. It is known that the general CMO problem (without the proximity requirement) is hard to approximate. However, with the proximity requirement, it is known that if a minimum inter-residue distance is imposed on the input, approximate solutions can be efficiently obtained. In this paper we mainly show that the CMO problem under these conditions: (1) is NP-hard, but (2) allows a PTAS. The rest of this paper shows algorithms for the LCP problem which improve on known results.