NMR paper An efficient branch-and-bound algorithm for the assignment of protein backbone NMR pe

		BioNMR > Educational resources > Journal club
[NMR paper] An efficient branch-and-bound algorithm for the assignment of protein backbone NMR pe

Webservers

NMR processing:

MDD

NMR assignment:

Backbone:

Side-chains:

NOEs:

Structure from NMR restraints:

Ab initio:

Fragment-based:

Rosetta-NMR (Robetta)

Template-based:

GeNMR

I-TASSER

Refinement:

Amber

Structure from chemical shifts:

Fragment-based:

Homology-based:

Torsion angles from chemical shifts:

Preditor

TALOS

Promega- Proline

Secondary structure from chemical shifts:

CSI (via RCI server)

TALOS

MICS caps, β-turns

d2D

PECAN

Flexibility from chemical shifts:

RCI

Interactions from chemical shifts:

HADDOCK

Chemical shifts re-referencing:

NMR model quality:

NOEs, other restraints:

Chemical shifts:

RDCs:

Pseudocontact shifts:

Protein geomtery:

SAVES2 or SAVES4

Quality Control Check

NMR spectrum prediction:

FANDAS

MestReS

V-NMR

Flexibility from structure:

Backbone S2

Methyl S2

B-factor

Molecular dynamics:

Gromacs

Amber

Antechamber

Chemical shifts prediction:

From structure:

Shiftx2

Sparta+

Camshift

CH3shift- Methyl

ArShift- Aromatic

ShiftS

Proshift

PPM

CheShift-2- Cα

From sequence:

Shifty

Camcoil

Poulsen_rc_CS

Disordered proteins:

MAXOCC

Format conversion & validation:

CCPN

From NMR-STAR 3.1

Validate NMR-STAR 3.1

NMR sample preparation:

Protein disorder:

DisMeta

Protein solubility:

Isotope labeling:

Solid-state NMR:

Thread Tools

Search this Thread

Rate Thread

Display Modes

11-24-2010, 08:49 PM

nmrlearner

Senior Member

Join Date: Jan 2005

Posts: 23,734

Points: 193,617, Level: 100

Level up: 0%, 0 Points needed

Activity: 50.7%

Last Achievements

Award-Showcase

NMR Credits: 0

NMR Points: 193,617

Downloads: 0

Uploads: 0

An efficient branch-and-bound algorithm for the assignment of protein backbone NMR pe

An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks.

Related Articles An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks.

Proc IEEE Comput Soc Bioinform Conf. 2002;1:165-74

Authors: Lin G, Xu D, Chen ZZ, Jiang T, Wen J, Xu Y

NMR resonance assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protein sequence, providing the prerequisite for establishing intra- and inter-residue spatial relationships between atoms. The assignment process is tedious and time-consuming, which could take many weeks. Though there exist a number of computer programs to assist the assignment process, many NMR labs are still doing the assignments manually to ensure quality. This paper presents a new computational method based on our recent work towards automating the assignment process, particularly the process of backbone resonance peak assignment. We formulate the assignment problem as a constrained weighted bipartite matching problem. While the problem, in the most general situation, is NP-hard, we present an efficient solution based on a branch-and-bound algorithm with effective bounding techniques and a greedy filtering algorithm for reducing the search space. Our experimental results on 70 instances of (pseudo) real NMR data derived from 14 proteins demonstrate that the new solution runs much faster than a recently introduced (exhaustive) two-layer algorithm and recovers more correct peak assignments than the two-layer algorithm.

PMID: 15838133 [PubMed - indexed for MEDLINE]

Source: PubMed

Did you find this post helpful?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Sparsely-sampled High-resolution 4-D Experiments for Efficient Backbone Resonance Assignment of Disordered Proteins Sparsely-sampled High-resolution 4-D Experiments for Efficient Backbone Resonance Assignment of Disordered Proteins Publication year: 2011 Source: Journal of Magnetic Resonance, In Press, Accepted Manuscript, Available online 4 January 2011</br> Jie, Wen , Jihui, Wu , Pei, Zhou</br> Intrinsically disordered proteins (IDPs) play important roles in many critical cellular processes. Due to their limited chemical shift dispersion, IDPs often require four pairs of resonance connectivities (H?, C?, C? and CO) for establishing sequential backbone assignment. Because most conventional 4-D...	nmrlearner	Journal club	0	01-05-2011 11:03 AM
Optimization of amino acid type-specific (13)C and (15)N labeling for the backbone assignment of membrane proteins by solution- and solid-state NMR with the UPLABEL algorithm. Optimization of amino acid type-specific (13)C and (15)N labeling for the backbone assignment of membrane proteins by solution- and solid-state NMR with the UPLABEL algorithm. Optimization of amino acid type-specific (13)C and (15)N labeling for the backbone assignment of membrane proteins by solution- and solid-state NMR with the UPLABEL algorithm. J Biomol NMR. 2010 Dec 18; Authors: Hefke F, Bagaria A, Reckel S, Ullrich SJ, Dötsch V, Glaubitz C, Güntert P We present a computational method for finding optimal labeling patterns for the backbone...	nmrlearner	Journal club	0	12-21-2010 01:00 PM
Optimization of amino acid type-specific 13C and 15N labeling for the backbone assignment of membrane proteins by solution- and solid-state NMR with the UPLABEL algorithm Optimization of amino acid type-specific 13C and 15N labeling for the backbone assignment of membrane proteins by solution- and solid-state NMR with the UPLABEL algorithm Abstract We present a computational method for finding optimal labeling patterns for the backbone assignment of membrane proteins and other large proteins that cannot be assigned by conventional strategies. Following the approach of Kainosho and Tsuji (Biochemistry 21:6273â??6279 (1982)), types of amino acids are labeled with 13C or/and 15N such that cross peaks between 13CO(i â?? 1) and 15NH(i) result only for pairs...	nmrlearner	Journal club	0	12-21-2010 02:14 AM
[NMR paper] GANA--a genetic algorithm for NMR backbone resonance assignment. GANA--a genetic algorithm for NMR backbone resonance assignment. Related Articles GANA--a genetic algorithm for NMR backbone resonance assignment. Nucleic Acids Res. 2005;33(14):4593-601 Authors: Lin HN, Wu KP, Chang JM, Sung TY, Hsu WL NMR data from different experiments often contain errors; thus, automated backbone resonance assignment is a very challenging issue. In this paper, we present a method called GANA that uses a genetic algorithm to automatically perform backbone resonance assignment with a high degree of precision and recall....	nmrlearner	Journal club	0	11-24-2010 11:14 PM
[NMR paper] Computational assignment of protein backbone NMR peaks by efficient bounding and filt Computational assignment of protein backbone NMR peaks by efficient bounding and filtering. Related Articles Computational assignment of protein backbone NMR peaks by efficient bounding and filtering. J Bioinform Comput Biol. 2003 Jul;1(2):387-409 Authors: Lin G, Xu D, Chen ZZ, Jiang T, Wen J, Xu Y NMR resonance assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protein sequence, providing the prerequisite for establishing intra- and...	nmrlearner	Journal club	0	11-24-2010 09:16 PM
[NMR paper] An efficient 3D NMR technique for correlating the proton and 15N backbone amide reson An efficient 3D NMR technique for correlating the proton and 15N backbone amide resonances with the alpha-carbon of the preceding residue in uniformly 15N/13C enriched proteins. Related Articles An efficient 3D NMR technique for correlating the proton and 15N backbone amide resonances with the alpha-carbon of the preceding residue in uniformly 15N/13C enriched proteins. J Biomol NMR. 1991 May;1(1):99-104 Authors: Bax A, Ikura M A 3D NMR technique is described which correlates the amide proton and nitrogen resonances of an amino acid residue...	nmrlearner	Journal club	0	08-21-2010 11:16 PM
[NMR paper] A branch and bound algorithm for protein structure refinement from sparse NMR data se A branch and bound algorithm for protein structure refinement from sparse NMR data sets. http://www.ncbi.nlm.nih.gov/corehtml/query/egifs/http:--linkinghub.elsevier.com-ihub-images-PubMedLink.gif Related Articles A branch and bound algorithm for protein structure refinement from sparse NMR data sets. J Mol Biol. 1999 Jan 29;285(4):1691-710 Authors: Standley DM, Eyrich VA, Felts AK, Friesner RA, McDermott AE We describe new methods for predicting protein tertiary structures to low resolution given the specification of secondary structure and a...	nmrlearner	Journal club	0	08-21-2010 04:03 PM
Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH Jochen Volk, Torsten Herrmann and Kurt Wüthrich Journal of Biomolecular NMR; 2008; 41(3); pp 127 - 138 Abstract: MATCH (Memetic Algorithm and Combinatorial Optimization Heuristics) is a new memetic algorithm for automated sequence-specific polypeptide backbone NMR assignment of proteins. MATCH employs local optimization for tracing partial sequence-specific assignments within a global, population-based search environment, where the simultaneous application of local and global optimization heuristics...	daniel	Journal club	0	08-03-2008 03:24 AM

« Previous Thread | Next Thread »

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is On Trackbacks are Off Pingbacks are Off Refbacks are Off