Zobrazeno 1 - 10
of 684
pro vyhledávání: '"Moulton, Vincent"'
Autor:
Moulton, Vincent, Spillner, Andreas
Ranked tree-child networks are a recently introduced class of rooted phylogenetic networks in which the evolutionary events represented by the network are ordered so as to respect the flow of time. This class includes the well-studied ranked phylogen
Externí odkaz:
http://arxiv.org/abs/2410.10667
Phylogenetic networks are graphs that are used to represent evolutionary relationships between different taxa. They generalize phylogenetic trees since for example, unlike trees, they permit lineages to combine. Recently, there has been rising intere
Externí odkaz:
http://arxiv.org/abs/2408.12997
Autor:
Lafond, Manuel, Moulton, Vincent
In phylogenetics, evolution is traditionally represented in a tree-like manner. However, phylogenetic networks can be more appropriate for representing evolutionary events such as hybridization, horizontal gene transfer, and others. In particular, th
Externí odkaz:
http://arxiv.org/abs/2408.06489
Phylogenetic diversity indices are commonly used to rank the elements in a collection of species or populations for conservation purposes. The derivation of these indices is typically based on some quantitative description of the evolutionary history
Externí odkaz:
http://arxiv.org/abs/2403.15842
In evolutionary biology, phylogenetic trees are commonly inferred from a set of characters (partitions) of a collection of biological entities (e.g., species or individuals in a population). Such characters naturally arise from molecular sequences or
Externí odkaz:
http://arxiv.org/abs/2311.09340
In evolutionary biology, networks are becoming increasingly used to represent evolutionary histories for species that have undergone non-treelike or reticulate evolution. Such networks are essentially directed acyclic graphs with a leaf set that corr
Externí odkaz:
http://arxiv.org/abs/2308.11176
A network $N$ on a finite set $X$, $|X|\geq 2$, is a connected directed acyclic graph with leaf set $X$ in which every root in $N$ has outdegree at least 2 and no vertex in $N$ has indegree and outdegree equal to 1; $N$ is arboreal if the underlying
Externí odkaz:
http://arxiv.org/abs/2308.06139
Phylogenetic networks are a special type of graph which generalize phylogenetic trees and that are used to model non-treelike evolutionary processes such as recombination and hybridization. In this paper, we consider {\em unrooted} phylogenetic netwo
Externí odkaz:
http://arxiv.org/abs/2212.08145
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial invariants for
Externí odkaz:
http://arxiv.org/abs/2209.12525
Autor:
Moulton, Vincent, Wu, Taoyang
RNA molecules are single-stranded analogues of DNA that can fold into various structures which influence their biological function within the cell. RNA structures can be modelled combinatorially in terms of a certain type of graph called an RNA diagr
Externí odkaz:
http://arxiv.org/abs/2204.05934