相关论文: Identifiability of 3-Class Jukes-Cantor Mixtures

This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…

We revisit the undecidability result of rank 3 intersection type inhabitation (Urzyczyn 2009) in pursuit of two goals. First, we strengthen the previous result by showing that intersection type inhabitation is undecidable for types of rank…

We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…

We compare a heuristic count of components of the center variety in degree 3 with the equivalent count obtained from known families. From this comparison we conjecture that more than 100 unknown components exist.

We produce new combinatorial methods for approaching the tropical maximal rank conjecture, including inductive procedures for deducing new cases of the conjecture on graphs of increasing genus from any given case. Using explicit…

In order to conduct a statistical analysis on a given set of phylogenetic gene trees, we often use a distance measure between two trees. In a statistical distance-based method to analyze discordance between gene trees, it is a key to decide…

Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…

Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…

Rooted triples, rooted binary phylogenetic trees on three leaves, are sufficient to encode rooted binary phylogenetic trees. That is, if $\mathcal T$ and $\mathcal T'$ are rooted binary phylogenetic $X$-trees that infers the same set of…

It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…

A number of methods have been developed to infer differential rates of species diversification through time and among clades using time-calibrated phylogenetic trees. However, we lack a general framework that can delineate and quantify…

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary…

Plants are fundamentally important to life. Key research areas in plant science include plant species identification, weed classification using hyper spectral images, monitoring plant health and tracing leaf growth, and the semantic…

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

Phylogenetic invariants are equations that vanish on algebraic varieties associated with Markov processes that model molecular substitutions on phylogenetic trees. For practical applications, it is essential to understand these equations…

Imagine being able to ask questions to a black box model such as "Which adversarial examples exist?", "Does a specific attribute have a disproportionate effect on the model's prediction?" or "What kind of predictions could possibly be made…

Here we propose a new method for the classification of texture images combining fractal measures (fractal dimension, multifractal spectrum and lacunarity) with local binary patterns. More specifically we compute the box counting dimension…

Classification of gene trees is an important task both in the analysis of multi-locus phylogenetic data, and assessment of the convergence of Markov Chain Monte Carlo (MCMC) analyses used in Bayesian phylogenetic tree reconstruction. The…

We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic…

When the characteristic of the underlying field is at least 5, we prove that the adjustment matrix for blocks of $q$-Schur algebras of weights 3 and 4 is the identity matrix. Moreover, we show that the decomposition numbers for weight 3…