### Abstract

We describe a simple and rapid algorithm for generating data structures and starting coordinates of polynucleotides for potential energy calculations. The algorithm is tailored to investigations in cartesian coordinate, rather than dihedral angle, space. First, instead of a tree structure for molecular design, we set up a helix from a simple list of bonds for the basic DNA subunits (sugar, phosphate, and bases). Second, instead of using successive transformations to obtain a set of coordinates in one reference frame, we apply a simple “matching” routine to patch DNA subunits. Third, we avoid ring closure and geometry optimization by allowing deviations from equilibrium values only for PO3′ bond lengths and O5′PO3′ bond angles at the residue connection sites. A double‐stranded helix is constructed from duplex building blocks (2 hydrogen‐bonded nucleotides) which are in turn built from the basic structural units. Every building block is constructed from two sets of geometric variables: {α, β, γ, χ, P, τ_{max}}, one for each strand. The building blocks are then assembled into a helix by using the 6 rigid body transformations {Δx, Δy, Δz, Θ_{ROLL}, Θ_{TILT}, Θ_{TWIST}}. For cartesian space programs, generating starting coordinates by this procedure is particularly useful as an alternative to using actual crystal structure coordinates. After describing the algorithm in detail, we illustrate how it was used to generate model A, B, and Z DNA helices. We conclude by suggesting how the algorithm can be used to pursue a build‐up technique and to set up a wide range of starting conformations in the goal of locating novel helical structures.

Original language | English (US) |
---|---|

Pages (from-to) | 861-889 |

Number of pages | 29 |

Journal | Journal of Computational Chemistry |

Volume | 9 |

Issue number | 8 |

DOIs | |

State | Published - 1988 |

### Fingerprint

### ASJC Scopus subject areas

- Chemistry(all)
- Computational Mathematics

### Cite this

**A modular strategy for generating starting conformations and data structures of polynucleotide helices for potential energy calculations.** / Schlick, Tamar.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - A modular strategy for generating starting conformations and data structures of polynucleotide helices for potential energy calculations

AU - Schlick, Tamar

PY - 1988

Y1 - 1988

N2 - We describe a simple and rapid algorithm for generating data structures and starting coordinates of polynucleotides for potential energy calculations. The algorithm is tailored to investigations in cartesian coordinate, rather than dihedral angle, space. First, instead of a tree structure for molecular design, we set up a helix from a simple list of bonds for the basic DNA subunits (sugar, phosphate, and bases). Second, instead of using successive transformations to obtain a set of coordinates in one reference frame, we apply a simple “matching” routine to patch DNA subunits. Third, we avoid ring closure and geometry optimization by allowing deviations from equilibrium values only for PO3′ bond lengths and O5′PO3′ bond angles at the residue connection sites. A double‐stranded helix is constructed from duplex building blocks (2 hydrogen‐bonded nucleotides) which are in turn built from the basic structural units. Every building block is constructed from two sets of geometric variables: {α, β, γ, χ, P, τmax}, one for each strand. The building blocks are then assembled into a helix by using the 6 rigid body transformations {Δx, Δy, Δz, ΘROLL, ΘTILT, ΘTWIST}. For cartesian space programs, generating starting coordinates by this procedure is particularly useful as an alternative to using actual crystal structure coordinates. After describing the algorithm in detail, we illustrate how it was used to generate model A, B, and Z DNA helices. We conclude by suggesting how the algorithm can be used to pursue a build‐up technique and to set up a wide range of starting conformations in the goal of locating novel helical structures.

AB - We describe a simple and rapid algorithm for generating data structures and starting coordinates of polynucleotides for potential energy calculations. The algorithm is tailored to investigations in cartesian coordinate, rather than dihedral angle, space. First, instead of a tree structure for molecular design, we set up a helix from a simple list of bonds for the basic DNA subunits (sugar, phosphate, and bases). Second, instead of using successive transformations to obtain a set of coordinates in one reference frame, we apply a simple “matching” routine to patch DNA subunits. Third, we avoid ring closure and geometry optimization by allowing deviations from equilibrium values only for PO3′ bond lengths and O5′PO3′ bond angles at the residue connection sites. A double‐stranded helix is constructed from duplex building blocks (2 hydrogen‐bonded nucleotides) which are in turn built from the basic structural units. Every building block is constructed from two sets of geometric variables: {α, β, γ, χ, P, τmax}, one for each strand. The building blocks are then assembled into a helix by using the 6 rigid body transformations {Δx, Δy, Δz, ΘROLL, ΘTILT, ΘTWIST}. For cartesian space programs, generating starting coordinates by this procedure is particularly useful as an alternative to using actual crystal structure coordinates. After describing the algorithm in detail, we illustrate how it was used to generate model A, B, and Z DNA helices. We conclude by suggesting how the algorithm can be used to pursue a build‐up technique and to set up a wide range of starting conformations in the goal of locating novel helical structures.

UR - http://www.scopus.com/inward/record.url?scp=84988073699&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988073699&partnerID=8YFLogxK

U2 - 10.1002/jcc.540090809

DO - 10.1002/jcc.540090809

M3 - Article

VL - 9

SP - 861

EP - 889

JO - Journal of Computational Chemistry

JF - Journal of Computational Chemistry

SN - 0192-8651

IS - 8

ER -