Výsledky vyhledávání

Report

Polyhedral computational geometry for averaging metric phylogenetic trees

Autor: Miller, Ezra, Owen, Megan, Provan, J. Scott

This paper investigates the computational geometry relevant to calculations of the Frechet mean and variance for probability distributions on the phylogenetic tree space of Billera, Holmes and Vogtmann, using the theory of probability measures on spa

Externí odkaz: http://arxiv.org/abs/1211.7046

Zobrazit plný text záznamu

Report

Minimum Opaque Covers for Polygonal Regions

Autor: Provan, J. Scott, Brazil, Marcus, Thomas, Doreen, Weng, Jia F.

The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity, the probl

Externí odkaz: http://arxiv.org/abs/1210.8139

Zobrazit plný text záznamu

Report

A Fast Algorithm for Computing Geodesic Distances in Tree Space

Autor: Owen, Megan, Provan, J. Scott

Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths is the len

Externí odkaz: http://arxiv.org/abs/0907.3942

Zobrazit plný text záznamu

Report

Enumeration in convex geometries and associated polytopal subdivisions of spheres

Autor: Billera, Louis J., Hsiao, Samuel K., Provan, J. Scott

We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The complete i

Externí odkaz: http://arxiv.org/abs/math/0505576

Zobrazit plný text záznamu