Related papers: Perfect Reconstruction of Oncogenetic Trees
Let $\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study…
Evolution is a process that is influenced by various environmental factors, e.g. the interactions between different species, genes, and biogeographical properties. Hence, it is interesting to study the combined evolutionary history of…
The mitigation of stress is a key challenge for all biological systems. Conditions of unresolvable stress have been associated with a diverse array of pathologies, from cancer to post-traumatic stress disorder (PTSD). Here, I unify insights…
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
It is known that there exist a limited number of analytic potentials with the unusual property that any bound quantum state therein will be periodic in time. This is known as a perfect quantum state revival. Examples of such potentials are…
The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $\ell$ vertices. An $n$-vertex graph is $\ell$-reconstructible if it is determined by its $(n-\ell)$-deck, meaning that no…
We present a computational model to reconstruct trees of ancestors for animals with sexual reproduction. Through a recursive algorithm combined with a random number generator, it is possible to reproduce the number of ancestors for each…
Stem cell heterogeneity is essential for the homeostasis in tissue development. This paper established a general formulation for understanding the dynamics of stem cell regeneration with cell heterogeneity and random transitions of…
Precision oncology aims to prescribe the optimal cancer treatment to the right patients, maximizing therapeutic benefits. However, identifying patient subgroups that may benefit more from experimental cancer treatments based on randomized…
We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger `supertree'. This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description…
We show how a few modifications to the red-black trees allow for $O(1)$ worst-case update time (once the position of the inserted or deleted element is known). The resulting structure is based on relaxing some of the properties of the…
In this paper, we further investigate the orthogonally connected sets and establish necessary and sufficient conditions for a set to be staircase connected.
Network reconstruction lies at the heart of phylogenetic research. Two well studied classes of phylogenetic networks include tree-child networks and level-$k$ networks. In a tree-child network, every non-leaf node has a child that is a tree…
We prove that one can perfectly pack degenerate graphs into complete or dense $n$-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}{\log n})$, and in addition $\Omega(n)$ of them have at most…
We study the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes (stopped at the explosion time), proving criteria for the associated tree to contain a node of infinite degree (a star) or an…
We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.
The problem of comparing trees representing the evolutionary histories of cancerous tumors has turned out to be crucial, since there is a variety of different methods which typically infer multiple possible trees. A departure from the…
We propose the following simple stochastic model for phylogenetic trees. New types are born and die according to a birth and death chain. At each birth we associate a fitness to the new type sampled from a fixed distribution. At each death…
The reconstruction of phylogenies from DNA or protein sequences is a major task of computational evolutionary biology. Common phenomena, notably variations in mutation rates across genomes and incongruences between gene lineage histories,…
The problem of reconstructing evolutionary trees or phylogenies is of great interest in computational biology. A popular model for this problem assumes that we are given the set of leaves (current species) of an unknown binary tree and the…