Difference between revisions of "Guess j nuc.m"

From Spinach Documentation Wiki
Jump to: navigation, search
(Syntax)
(Update function See also links and function index membership)
 
(3 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
{{DISPLAYTITLE:guess_j_nuc.m}} __NOTOC__
 
{{DISPLAYTITLE:guess_j_nuc.m}} __NOTOC__
This function assigns J-couplings in nucleic acids from atomic coordinates using semi-empirical estimates. It is a graph-theoretical estimator with the following stages:
+
Assigns ''J''-couplings in nucleic acids from atomic coordinates using semi-empirical estimates. It is a graph-theoretical estimator with the following stages:
  
# The molecular bonding graph is partitioned into connected subgraphs of size two, and one-bond J-couplings are assigned from a complete database of atom pairs. Our experience indicates that there are fewer than 50 unique connected atom pairs in regular nucleic acids, and that most one-bond J-couplings within those pairs can be either found in the literature, or measured in individual nucleic acids, or estimated with sufficient accuracy using electronic structure theory software.
+
# Molecular bonding graph is partitioned into connected subgraphs of size two, and one-bond ''J''-couplings are assigned from a complete database of atom pairs. There are fewer than 50 unique connected atom pairs in regular nucleic acids; most one-bond ''J''-couplings within those pairs can be either found in the literature, or measured in individual nucleic acids, or estimated with sufficient accuracy using electronic structure theory software.
# The molecular bonding graph is partitioned into connected subgraphs of size three, and two-bond J-couplings assigned from a complete database of connected atom triples. The number of unique connected atom triples in nucleic acids is also reasonable – fewer than 75 in regular ones, a small enough number for an exhaustive list to be compiled from experiments, literature and electronic structure theory estimates.
+
# Molecular bonding graph is partitioned into connected subgraphs of size three, and two-bond ''J''-couplings are assigned from a complete database of connected atom triples. There are fewer than 75 unique connected atom triples in nucleic acids, a small enough number for an exhaustive list to be compiled from experiments, literature, and electronic structure theory estimates.
# The molecular bonding graph is partitioned into sequentially connected subgraphs of size four and dihedral angles are computed from atomic coordinates, allowing three-bond J-couplings to be assigned from a complete database of Karplus curves. Karplus curves are a well-researched topic, with specific data available for the backbone and less accurate generic curves available for the rest of the structure. The number of unique sequentially connected atom quartets found in nucleic acids (fewer than 100, many belonging to similar structural types) is sufficiently small for a complete database of Karplus curves to be compiled from literature data, experiments, and electronic structure theory estimates.
+
# Molecular bonding graph is partitioned into sequentially connected subgraphs of size four and dihedral angles are computed from atomic coordinates, allowing three-bond ''J''-couplings to be assigned from a complete database of Karplus curves. The number of unique sequentially connected atom quartets found in nucleic acids (fewer than 100, many belonging to similar structural types) is sufficiently small for a complete database of Karplus curves to be compiled from literature data, experiments, and electronic structure theory estimates.
  
 
J-couplings across more than three bonds are ignored.
 
J-couplings across more than three bonds are ignored.
Line 12: Line 12:
 
     jmatrix=guess_j_nuc(nuc_num,nuc_typ,pdb_id,coords)
 
     jmatrix=guess_j_nuc(nuc_num,nuc_typ,pdb_id,coords)
  
==Arguments==
+
==Parameters==
  
 
     nuc_num  - nspins x 1 vector giving the number of the nucleotide to which each spin belongs
 
     nuc_num  - nspins x 1 vector giving the number of the nucleotide to which each spin belongs
Line 45: Line 45:
  
 
==See also==
 
==See also==
[[read_pdb_nuc.m]], [[protein.m]], [[guess_j_pro.m]], [[nuclacid.m]]
+
[[read_pdb_nuc.m]], [[protein.m]], [[guess_j_pro.m]], [[nuclacid.m]], [[awg_interface.m]], [[bootstrap.m]], [[gslice.m]], [[guess_csa_pro.m]], [[py_run.m]], [[retrieve_file.m]], [[spinach2hiper.m]], [[Import,_export,_and_visualisation]]
 
 
[[Import,_export,_and_visualisation#Data_import|Data import]]
 
 
 
  
 
''Version 2.8, authors: [[Ilya Kuprov]], [[Zenawi Welderufael]]''
 
''Version 2.8, authors: [[Ilya Kuprov]], [[Zenawi Welderufael]]''

Latest revision as of 19:37, 6 June 2026

Assigns J-couplings in nucleic acids from atomic coordinates using semi-empirical estimates. It is a graph-theoretical estimator with the following stages:

  1. Molecular bonding graph is partitioned into connected subgraphs of size two, and one-bond J-couplings are assigned from a complete database of atom pairs. There are fewer than 50 unique connected atom pairs in regular nucleic acids; most one-bond J-couplings within those pairs can be either found in the literature, or measured in individual nucleic acids, or estimated with sufficient accuracy using electronic structure theory software.
  2. Molecular bonding graph is partitioned into connected subgraphs of size three, and two-bond J-couplings are assigned from a complete database of connected atom triples. There are fewer than 75 unique connected atom triples in nucleic acids, a small enough number for an exhaustive list to be compiled from experiments, literature, and electronic structure theory estimates.
  3. Molecular bonding graph is partitioned into sequentially connected subgraphs of size four and dihedral angles are computed from atomic coordinates, allowing three-bond J-couplings to be assigned from a complete database of Karplus curves. The number of unique sequentially connected atom quartets found in nucleic acids (fewer than 100, many belonging to similar structural types) is sufficiently small for a complete database of Karplus curves to be compiled from literature data, experiments, and electronic structure theory estimates.

J-couplings across more than three bonds are ignored.

Syntax

    jmatrix=guess_j_nuc(nuc_num,nuc_typ,pdb_id,coords)

Parameters

    nuc_num  - nspins x 1 vector giving the number of the nucleotide to which each spin belongs

    nuc_typ  - nspins x 1 cell array of strings giving the PDB identifier of the nucleotide to 
               which each spin belongs (e.g. 'GUA')

    pdb_id   - nspins x 1 cell array of strings giving the PDB identifier of the nucleic acid atom 
               type to which each spin belongs (e.g. 'C1P')

    coords   - nspins x 1 cell array of 3-vectors giving cartesian coordinates of each spin in Angstrom

Outputs

    jmatrix  - nspins x nspins sparse matrix of J-couplings in Hz

Examples

The function accepts, for example, the output of read_pdb_nuc.m:

    % Parse the PDB file
    [pdb_nuc_num,pdb_nuc_typ,pdb_atom_id,pdb_coords]=read_pdb_nuc('example.pdb');

    % Guess the J-couplings
    jmatrix=guess_j_nuc(pdb_nuc_num,pdb_nuc_typ,pdb_atom_id,pdb_coords)

Notes

  1. You can modify the J-coupling database by editing the function text.
  2. Atoms in the subgraph descriptors are listed alphabetically to make the descriptors unique.
  3. The four numbers in the subgraph descriptors refer to the bonding order, e.g. [1, 3, 2, 4] means that the first atom in the descriptor is bonded to the third, which is bonded to the second, which is bonded to the fourth. The coupling in this case is between atom 1 and atom 4 in the descriptor.
  4. J-couplings produced by this functions are rough estimates. For accurate nucleic acid work you must supply your own J-couplings.
  5. This is an auxiliary function that is called by nuclacid.m; direct calls should not be necessary.

See also

read_pdb_nuc.m, protein.m, guess_j_pro.m, nuclacid.m, awg_interface.m, bootstrap.m, gslice.m, guess_csa_pro.m, py_run.m, retrieve_file.m, spinach2hiper.m, Import,_export,_and_visualisation

Version 2.8, authors: Ilya Kuprov, Zenawi Welderufael