Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Protein structure determination using protein threading and sparse NMR data (extended abstract)
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Large a polynomial-time nuclear vector replacement algorithm for automated NMR resonance assignments
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
A markov random field framework for protein side-chain resonance assignment
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Hi-index | 0.00 |
Recognition of a protein's fold provides valuable informationabout its function. While many sequence-based homologyprediction methods exist, an important challengeremains: two highly dissimilar sequences can have similarfolds - how can we detect this rapidly, in the context ofstructural genomics? High-throughput NMR experiments,coupled with novel algorithms for data analysis, can addressthis challenge. We report an automated procedure fordetecting 3D structural homologies from sparse, unassignedprotein NMR data.Our method identifies the 3D structural models in a proteinstructural database whose geometries best fit the unassignedexperimental NMR data. It does not use sequenceinformation and is thus not limited by sequence homology.The method can also be used to confirm or refutestructural predictions made by other techniques such asprotein threading or sequence homology. The algorithmruns in O(pnk3) time, where p is the number of proteinsin the database, n is the number of residues in the targetprotein, and k is the resolution of a rotation search.The method requires only uniform 15N-labelling of the proteinand processes unassigned HN-15N residual dipolarcouplings, which can be acquired in a couple of hours.Our experiments on NMR data from 5 different proteinsdemonstrate that the method identifies closely related proteinfolds, despite low-sequence homology between the targetprotein and the computed model.