Toric ideals of homogeneous phylogenetic models

Authors:
Nicholas Eriksson
Affiliations:
University of California, Berkeley, Berkeley, CA
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 1
Cited 2

Converting bases with the Gröbner walk

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference

Computing generating sets of lattice ideals and Markov bases of lattices

Journal of Symbolic Computation
Viterbi sequences and polytopes

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the model of phylogenetic trees in which every node of the tree is an observed, binary random variable and the transition probabilities are given by the same matrix on each edge of the tree. The ideal of invariants of this model is a toric ideal in ℂ[p;i1;…i;n;]. We are able to compute the Göbner basis and minimal generating set for this ideal for trees with up to 11 nodes. These are the first non-trivial Gröbner bases calculations in 211 = 2048 indeterminates. We conjecture that there is a quadratic Gröbner basis for binary trees, but that generators of degree n are required for some trees with n nodes. The polytopes associated with these toric ideals display interesting finiteness properties. We describe the polytope for an infinite family of binary trees and conjecture (based on extensive computations) that there is a universal bound on the number of vertices of the polytope of a binary tree.