PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 12915273

Conformon-driven biopolymer shape changes in cell modeling.

Sungchul Ji·Gabriel Ciobanu
View original source ↗Export metadata ↓

Abstract

Conceptual models of the atom preceded the mathematical model of the hydrogen atom in physics in the second decade of the 20th century. The computer modeling of the living cell in the 21st century may follow a similar course of development. A conceptual model of the cell called the Bhopalator was formulated in the mid-1980s, along with its twin theories known as the conformon theory of molecular machines and the cell language theory of biopolymer interactions [Ann. N.Y. Acad. Sci. 227 (1974) 211; BioSystems 44 (1997) 17; Ann. N.Y. Acad. Sci. 870 (1999a) 411; BioSystems 54 (2000) 107; Semiotica 138 (1-4) (2002a) 15; Fundamenta Informaticae 49 (2002b) 147]. The conformon theory accounts for the reversible actions of individual biopolymers coupled to irreversible chemical reactions, while the cell language theory provides a theoretical framework for understanding the complex networks of dynamic interactions among biopolymers in the cell. These two theories are reviewed and further elaborated for the benefit of both computational biologists and computer scientists who are interested in modeling the living cell and its functions. One of the critical components of the mechanisms of cell communication and cell computing has been postulated to be space- and time-organized teleonomic (i.e. goal-directed) shape changes of biopolymers that are driven by exergonic (free energy-releasing) chemical reactions. The generalized Franck-Condon principle is suggested to be essential in resolving the apparent paradox arising when one attempts to couple endergonic (free energy-requiring) biopolymer shape changes to the exergonic chemical reactions that are catalyzed by biopolymer shape changes themselves. Conformons, defined as sequence-specific mechanical strains of biopolymers first invoked three decades ago to account for energy coupling in mitochondria, have been identified as shape changers, the agents that cause shape changes in biopolymers. Given a set of space- and time-organized teleonomic shape changes of biopolymers driven by conformons, all of the functions of the cell can be accounted for in molecular terms-at least in principle. To convert a conceptual model of the cell into a computer model, it is necessary to represent the conceptual model in an algebraic language. To this end, we have begun to apply the process algebra of Milner [Communicating and Mobile Systems: The pi-calculus, Cambridge University Press, Cambridge, 1999] to develop what is here called the "shape algebra," capable of describing complex and mobile patterns of interactions among biomolecules leading to cell functions.

Explore related subjects

AlgorithmsBiopolymersCell CommunicationCell MembraneCell Physiological PhenomenaComputers, MolecularComputing MethodologiesEnvironmentExtracellular SpaceInformation Storage and RetrievalIon TransportModels, BiologicalNonlinear DynamicsTerminology as TopicJournal ArticleResearch Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sungchul Ji, Gabriel Ciobanu. 2003. Conformon-driven biopolymer shape changes in cell modeling.. https://doi.org/10.1016/s0303-2647(03)00038-8

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↗