PubMed Health⌕ Search

PubMed · 8427940

A Monte Carlo method for generating structures of short single-stranded DNA sequences.

Abstract

A Monte Carlo method has been developed for generating the conformations of short single-stranded DNAs from arbitrary starting states. The chain conformers are constructed from energetically favorable arrangements of the constituent mononucleotides. Minimum energy states of individual dinucleotide monophosphate molecules are identified using a torsion angle minimizer. The glycosyl and acyclic backbone torsions of the dimers are allowed to vary, while the sugar rings are held fixed in one of the two preferred puckered forms. A total of 108 conformationally distinct states per dimer are considered in this first stage of minimization. The torsion angles within 5 kcal/mole of the global minimum in the resulting optimized states are then allowed to vary by +/- 10 degrees in an effort to estimate the breadth of the different local minima. The energies of a total of 2187 (3(7)) angle combinations are examined per local conformational minimum. Finally, the energies of all dinucleotide conformers are scaled so that the populations of differently puckered sugar rings in the theoretical sample match those found in nmr solution studies. This last step is necessitated by limitations in the theoretical methods to predict DNA sugar puckering accurately. The conformer populations of the individual acyclic torsion angles in the composite dimer ensembles are found to be in good agreement with the distributions of backbone conformations deduced from nmr coupling constants and the frequencies of glycosyl conformations in x-ray crystal structures, suggesting that the low energy states are reasonable. The low energy dimer forms (consisting of 150-325 conformational states per dimer step) are next used as variables in a Monte Carlo algorithm, which generates the conformations of single-stranded d(CXnG) chains, where X = A, T and n = 3, 4, 5. The oligonucleotides are built sequentially from the 5' end of the chain using random numbers to select the conformations of overlapping dimer units. The simulations are very fast, involving a total of 10(6) conformations per chain sequence. The potential errors in the buildup procedure are minimized by taking advantage of known rotational interdependences in the sugar-phosphate backbone. The distributions of oligonucleotide conformations are examined in terms of the magnitudes, positions, and orientations of the end-to-end vectors of the chains. The differences in overall flexibility and extension of the oligomers are discussed in terms of the conformations of the constituent dinucleotide steps, while the general methodology is discussed and compared with other nucleic acid model building techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D A Erie, K J Breslauer, W K Olson. 1993. A Monte Carlo method for generating structures of short single-stranded DNA sequences.. https://doi.org/10.1002/bip.360330109

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗