Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0409132

The Mathematics of Phylogenomics

Lior Pachter·Bernd Sturmfels
View original source ↗Read source document ↗Export metadata ↓

Abstract

The grand challenges in biology today are being shaped by powerful high-throughput technologies that have revealed the genomes of many organisms, global expression patterns of genes and detailed information about variation within populations. We are therefore able to ask, for the first time, fundamental questions about the evolution of genomes, the structure of genes and their regulation, and the connections between genotypes and phenotypes of individuals. The answers to these questions are all predicated on progress in a variety of computational, statistical, and mathematical fields. The rapid growth in the characterization of genomes has led to the advancement of a new discipline called Phylogenomics. This discipline results from the combination of two major fields in the life sciences: Genomics, i.e., the study of the function and structure of genes and genomes; and Molecular Phylogenetics, i.e., the study of the hierarchical evolutionary relationships among organisms and their genomes. The objective of this article is to offer mathematicians a first introduction to this emerging field, and to discuss specific mathematical problems and developments arising from phylogenomics.

Explore related subjects

math.STq-bio.QMstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lior Pachter, Bernd Sturmfels. 2005-09-27. The Mathematics of Phylogenomics. https://arxiv.org/abs/math/0409132

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A dynamic residual measure of inaccuracy based on varextropy

In this paper, we introduce a variance-based inaccuracy measure for order statistics based on the concept of varextropy. The proposed measure provides a framework for quantifying the variability of the inaccuracy function between an order statistic and its parent distribution. We establish a transformation property of the proposed measure under strictly increasing differentiable transformations. We establish theoretical upper and lower bounds for this measure. We further develop a dynamic residual version of the proposed inaccuracy measure and establish characterization results for the underlying distribution. Furthermore, we derive bounds for the dynamic residual inaccuracy measures based on extropy and varextropy. Finally, a nonparametric estimator of the proposed measure is developed and applied to real data to assess the goodness-of-fit of candidate distributions and facilitate model selection. 1.

math.ST↗
arXiv2026

Can one regularizer reproduce posterior means at two noise levels?

Consider Gaussian denoising with a fixed prior and varying noise variance. When the prior has a density, maximum a posteriori estimation uses its negative logarithm as a fixed regularizer; only the weight of the quadratic data term changes with the noise variance. We ask whether a fixed regularizer can also recover the posterior mean. Although a suitable regularizer exists at each variance, we prove that no single regularizer works at two distinct positive variances for any compactly supported prior other than a point mass. This holds even for nonconvex and nonsmooth regularizers. A residual computed from two denoiser evaluations gives positive lower bounds on the uniform approximation error and excess mean squared error of estimators using a common regularizer. Numerical examples illustrate these bounds and the cost of reusing a regularizer across noise levels.

math.ST↗
arXiv2026

On Universality of Non-Separable Approximate Message Passing Algorithms

Mean-field characterizations of first-order iterative algorithms -- including Approximate Message Passing (AMP), stochastic and proximal gradient descent, and Langevin diffusions -- have enabled a precise understanding of learning dynamics in many statistical applications. For algorithms whose non-linearities have a coordinate-separable form, it is known that such characterizations enjoy a degree of universality with respect to the underlying data distribution. However, mean-field characterizations of non-separable algorithm dynamics have largely remained restricted to i.i.d. Gaussian or rotationally-invariant data. In this work, we initiate a study of universality for non-separable AMP algorithms. We identify a general condition for AMP with polynomial non-linearities, in terms of a Bounded Composition Property (BCP) for their representing tensors, to admit a state evolution that holds universally for matrices with non-Gaussian entries. We then formalize a condition of BCP-approximability for Lipschitz AMP algorithms to enjoy a similar universal guarantee. We demonstrate that many common classes of non-separable non-linearities are BCP-approximable, including local denoisers, spectral denoisers for generic signals, and compositions of separable functions with generic linear maps, implying the universality of state evolution for AMP algorithms employing these non-linearities.

math.ST↗