Related papers: Parametric Fermat-Weber and tropical supertrees
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…
Phylogenetic trees are leaf-labelled trees, where the leaves correspond to extant species (taxa), and the internal vertices represent ancestral species. The evolutionary history of a set of species can be explained by more than one…
In a previous work, we gave a metric on the class of semibinary tree-sibling time consistent phylogenetic networks that is computable in polynomial time; in particular, the problem of deciding if two networks of this kind are isomorphic is…
A parametric approach is developed to the method of S-tree diagrams and its generalization for investigation of the hierarchical substructure of $N$-body nonlinearly interacting systems (e.g., clusters of galaxies). The introduction of a…
We give algorithms to compute the Fr\'echet distance of trees and graphs with bounded tree width. Our algorithms run in $O(n^2)$ time for trees of bounded degree, and $O(n^2\sqrt{n \log n})$ time for trees of arbitrary degree. For graphs of…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
The neighbor-joining algorithm is a popular phylogenetics method for constructing trees from dissimilarity maps. The neighbor-net algorithm is an extension of the neighbor-joining algorithm and is used for constructing split networks. We…
Each gene has its own evolutionary history which can substantially differ from the evolutionary histories of other genes. For example, some individual genes or operons can be affected by specific horizontal gene transfer and recombination…
We provide a complete extension of Minimal Walking Technicolor able to account for the standard model fermion masses. The model is supersymmetric at energies greater or equal to the technicolor compositeness scale. We integrate out, at the…
We develop the algebraic polynomial theory for "supertropical algebra," as initiated earlier over the real numbers by the first author. The main innovation there was the introduction of "ghost elements," which also play the key role in our…
In this text, we merge ideas around the tropical hyperfield with the theory of ordered blueprints to give a new formulation of tropical scheme theory. The key insight is that a nonarchimedean absolute value can be considered as a morphism…
It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…
This work investigates minimal parametric networks in hyperspaces of closed subsets of metric spaces endowed with the Hausdorff distance. It is shown that the problems of finding such networks are nontrivial only within finiteness classes,…
We revisit the representation theory in type $A$used previously to establish that the dissimilarity vectors of phylogenetic trees are points on the tropical Grassmannian variety. We use a different version of this construction to show that…
We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms…
Phylogenetic trees are simple models of evolutionary processes. They describe conditionally independent divergent evolution of taxa from common ancestors. Phylogenetic trees commonly do not have enough flexibility to adequately model all…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…
We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is…
Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully…