ConfMatch: automating electron-density map interpretation by matching conformations.
Building a protein model from the initial three-dimensional electron-density distribution (density map) is an important task in X-ray crystallography. This problem is computationally challenging because proteins are extremely flexible. The algorithm ConfMatch is a global real-space fitting procedure in torsion-angle space. It solves this 'map-interpretation' problem by matching a detailed conformation of the molecule to the density map (conformational matching). This 'best-match' structure is defined as one which maximizes the sum of the density at atom positions. ConfMatch is a practical systematic algorithm based on a branch-and-bound search. The most important idea of ConfMatch is an efficient method for computing accurate bounds. ConfMatch relaxes the conformational matching problem, a problem which can only be solved in exponential time, into one which can be solved in polynomial time. The solution to the relaxed problem is a guaranteed upper bound for the conformational matching problem. In most empirical cases, these bounds are accurate enough to prune the search space dramatically, enabling ConfMatch to solve structures with more than 100 free dihedral angles. Experiments have shown that ConfMatch may be able to automate the interpretation of density maps of small proteins.
Wang
C E
CE
Artificial Intelligence Lab, MIT, 545 Technology Square, Cambridge, MA 02139-3539, USA. wang@ai.mit.edu
D000465:Algorithms; D001331:Automation; D018360:Crystallography, X-Ray / Q000379:methods; D004583:Electrons; D008956:Models, Chemical; D008958:Models, Molecular; D010363:Pattern Recognition, Automated; D010455:Peptides / Q000737:chemistry; D010940:Plant Proteins / Q000737:chemistry; D011487:Protein Conformation; D012984:Software
D010455:Peptides; D010940:Plant Proteins; C024934:crambin protein, Crambe abyssinica