Structures of isopropylidene nucleoside derivatives - implications for ribose ring flexibility under external cyclic constraints

Crystal structures of six isopropylidene nucleoside derivatives are described. The results show that, under external cyclic constraints, the ribose assumes a variety of unusual conformations. In those compounds which possess a base-to-sugar cyclization through the C(4′) atom, the furanose pucker is predominantly C(4′)-endo, O(4′)-exo. The possible relevance of the sulphur geometry in two of the compounds to certain structural aspects of the action of the enzyme thymidylate synthetase is also pointed out.

Flexibility of the furanose ring in nucleic acids: a compilation of crystal data

A compilation of crystal structure data on deoxyribo- and ribonucleosides and their higher derivatives is presented. The aim of this paper is to highlight the flexibility of deoxyribose and ribose rings. So far, the conformational parameters of nucleic acids constituents of ribose and deoxyribose have not been analysed separately. This paper aims to correlate the conformational parameters with the nature and puckering of the sugar. Deoxyribose puckering occurs in the C2′ endo region while ribose puckering is observed both in the C3′ endo and C2′ endo regions. A few endocyclic and exocyclic bond angles depend on the puckering and the nature of the sugar. The majority of structures have an anti conformation about the glycosyl bond. There appears to be a puckering dependence on the torsion angle about the C4′---C5′ bonds. Such stereochemical information is useful in model building studies of polynucleotides and nucleic acids.

Description of ring puckering of furanose: An analytical approach

An analytical approach for the description of the ring puckerings from the endocyclic ring torsion angles of a five-membered saturated ring is given. This description is independent of any reference conformation. For the description, a revised notation for the endocyclic ring torsion angles has been suggested. The application of this method to the furanose ring is described in detail.

A parallel wilf algorithm for complex zeros of a polynomial

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.