Results 1 to 10 of about 126 (103)
Polyhedral combinatorics of UPGMA cones
Advances in Applied Mathematics, 2013 Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm.
Seth Sullivant, Ruth Davidson
exaly +3 more sources
Polyhedral combinatorics of bisectors
Advances in GeometryAbstract For any polyhedral norm, the bisector of two points is a polyhedral complex. We study combinatorial aspects of this complex. We investigate the sensitivity of the presence of labelled maximal cells in the bisector relative to the position of the two points.
Katharina Jochemko
exaly +4 more sources
Polyhedral geometry and combinatorics of an autocatalytic ecosystem
Journal of Mathematical ChemistryDeveloping a mathematical understanding of autocatalysis in reaction networks has both theoretical and practical implications. We review definitions of autocatalytic networks and prove some properties for minimal autocatalytic subnetworks (MASs). We show that it is possible to classify MASs in equivalence classes, and develop mathematical results about
VÍCTOR Blanco +2 more
exaly +3 more sources
An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics [PDF]
Lecture Notes in Computer Science, 2015 30 pages, 18 ...
exaly +3 more sources
The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective [PDF]
European Journal of Operational Research, 2020 In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We prove that the problem is well-defined and (weakly) polynomial when (i) there is a way to reach the target state from any initial
Matthieu Guillot, Gautier Stauffer
openaire +3 more sources
Ricci Curvature on Polyhedral Surfaces via Optimal Transportation
Axioms, 2014 The problem of correctly defining geometric objects, such as the curvature, is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.
Benoît Loisel, Pascal Romon
doaj +1 more source
Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences
Discrete Applied Mathematics, 2017 Reneta P Barneva
exaly +2 more sources
Mapping the discrete folding landscape
Communications PhysicsFolding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.
João C. Neves +3 more
doaj +1 more source
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics [PDF]
Bioinformatics, 2002 Abstract Multiple sequence alignment is one of the dominant problems in computational molecular biology. Numerous scoring functions and methods have been proposed, most of which result in NP-hard problems. In this paper we propose for the first time a general formulation for multiple alignment with arbitrary gap-costs based on an integer
Ernst Althaus +3 more
openaire +3 more sources