Importance Sampling Approximation of Sequence Evolution Models with Site-Dependence
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912539266252800 |
|---|---|
| author | Mathews, Joseph Schmidler, Scott C. |
| author_facet | Mathews, Joseph Schmidler, Scott C. |
| contents | We consider models for molecular sequence evolution in which the transition rates at each site depend on the local sequence context, giving rise to a time-inhomogeneous Markov process in which sites evolve under a complex dependency structure. We introduce a randomized approximation algorithm for the marginal sequence likelihood under these models using importance sampling, and provide matching order upper and lower bounds on the finite sample approximation error. Given two sequences of length $n$ with $r$ observed mutations, we show that for practical regimes of $r/n$, the complexity of the importance sampler does not grow exponentially $n$, but rather in $r$, making the algorithm practical for many applied problems. We demonstrate the use of our techniques to obtain problem-specific complexity bounds for a well-known dependent-site model from the phylogenetics literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11461 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Importance Sampling Approximation of Sequence Evolution Models with Site-Dependence Mathews, Joseph Schmidler, Scott C. Computation Probability We consider models for molecular sequence evolution in which the transition rates at each site depend on the local sequence context, giving rise to a time-inhomogeneous Markov process in which sites evolve under a complex dependency structure. We introduce a randomized approximation algorithm for the marginal sequence likelihood under these models using importance sampling, and provide matching order upper and lower bounds on the finite sample approximation error. Given two sequences of length $n$ with $r$ observed mutations, we show that for practical regimes of $r/n$, the complexity of the importance sampler does not grow exponentially $n$, but rather in $r$, making the algorithm practical for many applied problems. We demonstrate the use of our techniques to obtain problem-specific complexity bounds for a well-known dependent-site model from the phylogenetics literature. |
| title | Importance Sampling Approximation of Sequence Evolution Models with Site-Dependence |
| topic | Computation Probability |
| url | https://arxiv.org/abs/2508.11461 |