Search · four archives
Search · four archives
11 papers · ranked by Valyu relevance
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…
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…
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…
Joshua Daniel Curry
Most molecular docking tools today rely on stochastic sampling or heuristic optimization. They can be effective, but reproducibility is often hit or miss, and there’s no guarantee the best binding pose has been found. This paper introduces Spatial Needleman-Wunsch, a deterministic dynamic programming framework adapted…
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…
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…
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.…
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…
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)…
Max Doblas, Oscar Lostes-Cazorla, Quim Aguado-Puig, Cristian Iñiguez + 2 more
Pairwise sequence alignment is a core component of multiple sequencing-data analysis tools. Recent advancements in sequencing technologies have enabled the generation of longer sequences at a much lower price. Thus, long-read sequencing technologies have become increasingly popular in sequencing-based studies. However…
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…