Search · four archives
Search · four archives
14 papers · ranked by Valyu relevance
Sungho Shin, Ophelia Venturelli, Victor M. Zavala
We present a nonlinear programming (NLP) framework for the scalable solution of parameter estimation problems that arise in dynamic modeling of biological systems. Such problems are computationally challenging because they often involve highly nonlinear and stif differential equations as well as many experimental data…
Vahid Mardanlou, Elisa Franco
In a synthetic biological network it may often be desirable to maximize or minimize parameters such as reaction rates, fluxes and total concentrations of reagents, while preserving a given dynamic behavior. We consider the problem of parameter optimization in biomolecular bistable circuits. We show that, under some…
Kangbien Park
Humans have long employed directed evolution (DE) to engineer desired biological traits. In this paper, I introduce an algebraic framework that provides a quantitative representation of the general phenotypic traits of asexual populations, enabling the systematic modeling of DE processes. Within this framework, key…
Jonathan Ferrer-Mestres, Thomas G. Dietterich, Olivier Buffet, Iadine Chadès
In conservation of biodiversity, natural resource management and behavioural ecology, stochastic dynamic programming, and its mathematical framework, Markov decision processes (MDPs), are used to inform sequential decision-making under uncertainty. Models and solutions of Markov decision problems should be…
Henri Schmidt, Yuanyuan Qi, Benjamin J. Raphael, Mohammed El-Kebir
Reconstructing the evolutionary history of tumors from bulk DNA sequencing of multiple tissue samples remains a challenging computational problem, requiring simultaneous deconvolution of the tumor tissue and inference of its evolutionary history. Recently, phylogenetic reconstruction methods have made significant…
Bertrand Marchand, Yann Ponty, Laurent Bulteau
Hard graph problems are ubiquitous in Bioinformatics, inspiring the design of specialized Fixed-Parameter Tractable algorithms, many of which rely on a combination of tree-decomposition and dynamic programming. The time/space complexities of such approaches hinge critically on low values for the treewidth tw of the…
Arturo Tozzi
A wide range of biological and evolutionary processes is determined not merely by the occurrence of specific events, but by the exact order in which those events unfold. Gene regulation, developmental pathways, metabolic cascades and genetic evolution often display non-commutative behaviour, in which reversing the…
Nikolai Baudis, Pierre Barbera, Sebastian Graf, Sarah Lutteropp + 3 more
In the context of a master level programming practical at the computer science department of the Karlsruhe Institute of Technology, we developed and make available two independent and highly optimized open-source implementations for the pair-wise statistical alignment model, also known as TKF91, that was developed by…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…
Haojing Shao, Jue Ruan
Increasing the accuracy of the nucleotide sequence alignment is an essential issue in genomics research. Although classic dynamic-programming algorithms (e.g., Smith-Waterman and Needleman–Wunsch) guarantee to produce the optimal result, their time complexity hinders the application of large-scale sequence alignment.…
Tobias Røikjer, Asger Hobolth, Kasper Munch
Phase-type distributions model the time until absorption in continuous or discrete-time Markov chains on a finite state space. The multivariate phase-type distributions have diverse and important applications by modeling rewards accumulated at visited states. However, even moderately-sized state spaces make the…
Ragnar Groot Koerkamp
We introduce APA2, an exact global pairwise aligner with respect to edit distance. The goal of APA2 is to unify the near-linear runtime of APA on similar sequences with the efficiency of dynamic programming (DP) based methods. Like Edlib, APA2 uses Ukkonen’s band doubling in combination with Myers’ bitpacking. APA2 1)…
Lorién López-Villellas, Cristian Iñiguez, Albert Jiménez-Blanco, Quim Aguado-Puig + 4 more
Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce…
Junfeng Zuo, Cheng Xue, Si Wu, Wen-Hao Zhang
Cognitive reasoning, also known as mental programming, is fundamental to our intelligence. A central function in mental programming is working memory (WM), involving both temporarily maintaining the information and manipulating it based on rules. While the neural mechanisms of WM maintenance have been extensively…