Probabilistic sequence alignments: realistic models with efficient algorithms
E. Yeramian, E. Debonneuil
Abstract
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for gaps can be computed with fast algorithms. Improved performances of probabilistic alignments with realistic models of gaps are illustrated. Probabilistic and optimization formulations are compared, with potential implications in many fields and perspectives for computationally efficient extensions to Markov models with realistic long-range interactions.
Create a lesson
Related papers
Learning Interpretable Tumor Microenvironment Representations by Fitting Pan-Cancer Cell State-Niche Correlation
Xiao Xiao, Jiashu He, Shiyang Zhang et al.
Optimizing RNA yield using deep neural networks coupled to massively parallel screening
Dinghai Zheng, Justin Hong, Jun Wang et al.
A Conditional Structure-Aware Generative Transformer for Multi-Objective Design of m1Ψ-Modified RNA 5' UTRs
Narges Zarnaghinaghsh, Ahmadreza Mofayezi, Byung-Jun Yoon
mLS-GKM: Efficient Multi-class Regulatory Sequence Classification with Gapped k-mer SVMs
Kieran Howard, Nathan Harmston
DNA Methylation Profiling in Melanoma: From Lesion Classification to Therapeutic Stratification
Jana T. Winterstein, Lukas Heinlein, Günter Raddatz et al.
Hepatitis C Virus Genotyping with a Transformer Neural Network
Ariella Aro, Taimá Furuyama, Marcelo R. S. Briones et al.