Reconsidering complete search algorithms for protein backbone NMR assignment
1Department of Statistics, Purdue University West Lafayette, IN 47907, USA
2Department of Computer Sciences, Purdue University West Lafayette, IN 47907, USA
3Department of Computer Science, Dartmouth College Hanover, NH 03755, USA
*To whom correspondence should be addressed.
Motivation: Nuclear magnetic resonance (NMR) spectroscopy is widely used to determine and analyze protein structures. An essential step in NMR studies is determining the backbone resonance assignment, which maps individual atoms to experimentally measured resonance frequencies. Performing assignment is challenging owing to the noise and ambiguity in NMR spectra. Although automated procedures have been investigated, by-and-large they are still struggling to gain acceptance because of inherent limits in scalability and/or unacceptable levels of assignment error. To have confidence in the results, an algorithm should be complete, i.e. able to identify all solutions consistent with the data, including all arbitrary configurations of extra and missing peaks. The ensuing combinatorial explosion in the space of possible assignments has led to the perception that complete search is hopelessly inefficient and cannot scale to realistic datasets.
Results: This paper presents a complete branch-contract-and-bound search algorithm for backbone resonance assignment. The algorithm controls the search space by hierarchically agglomerating partial assignments and employing statistically sound pruning criteria. It considers all solutions consistent with the data, and uniformly treats all combinations of extra and missing data. We demonstrate our approach on experimental data from five proteins ranging in size from 70 to 154 residues. The algorithm assigns >95% of the positions with >98% accuracy. We also present results on simulated data from 259 proteins from the RefDB database, ranging in size from 25 to 257 residues. The median computation time for these cases is 1 min, and the assignment accuracy is >99%. These results demonstrate that complete search not only has the advantage of guaranteeing fair treatment of all feasible solutions, but is efficient enough to be employed effectively inpractice.
Availability: The MBA2 software package is made available under an open-source software license. The datasets featured in the Results section can also be obtained from the contact author.
Contact: ovitek{at}stat.purdue.edu
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  F. Xiong, G. Pandurangan, and C. Bailey-Kellogg Contact replacement for NMR resonance assignment Bioinformatics, July 1, 2008; 24(13): i205 - i213. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
H. Kamisetty, C. Bailey-Kellogg, and G. Pandurangan An efficient randomized algorithm for contact-based NMR backbone resonance assignment Bioinformatics, January 15, 2006; 22(2): 172 - 180. [Abstract] [Full Text] [PDF]
|
|