Study of ionic currents across a model membrane channel using Brownian dynamics.

S H Chung; M Hoyles; T Allen; S Kuyucak

doi:10.1016/s0006-3495(98)77569-1

Home/Archive/PubMed

PubMed · 9675181

Study of ionic currents across a model membrane channel using Brownian dynamics.

S H Chung·M Hoyles·T Allen·S Kuyucak

View original source ↗Export metadata ↓

Abstract

Brownian dynamics simulations have been carried out to study ionic currents flowing across a model membrane channel under various conditions. The model channel we use has a cylindrical transmembrane segment that is joined to a catenary vestibule at each side. Two cylindrical reservoirs connected to the channel contain a fixed number of sodium and chloride ions. Under a driving force of 100 mV, the channel is virtually impermeable to sodium ions, owing to the repulsive dielectric force presented to ions by the vestibular wall. When two rings of dipoles, with their negative poles facing the pore lumen, are placed just above and below the constricted channel segment, sodium ions cross the channel. The conductance increases with increasing dipole strength and reaches its maximum rapidly; a further increase in dipole strength does not increase the channel conductance further. When only those ions that acquire a kinetic energy large enough to surmount a barrier are allowed to enter the narrow transmembrane segment, the channel conductance decreases monotonically with the barrier height. This barrier represents those interactions between an ion, water molecules, and the protein wall in the transmembrane segment that are not treated explicitly in the simulation. The conductance obtained from simulations closely matches that obtained from ACh channels when a step potential barrier of 2-3 kTr is placed at the channel neck. The current-voltage relationship obtained with symmetrical solutions is ohmic in the absence of a barrier. The current-voltage curve becomes nonlinear when the 3 kTr barrier is in place. With asymmetrical solutions, the relationship approximates the Goldman equation, with the reversal potential close to that predicted by the Nernst equation. The conductance first increases linearly with concentration and then begins to rise at a slower rate with higher ionic concentration. We discuss the implications of these findings for the transport of ions across the membrane and the structure of ion channels.

Explore related subjects

Algorithms Biophysics Cell Membrane Electric Conductivity Ion Channels Membrane Potentials Membrane Proteins Models, Biological Journal Article Research Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

S H Chung, M Hoyles, T Allen, S Kuyucak. 1998. Study of ionic currents across a model membrane channel using Brownian dynamics.. https://doi.org/10.1016/s0006-3495(98)77569-1

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

KEEP EXPLORING

Related citations

PubMed2026

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↗

PubMed2026

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↗

PubMed2026

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↗