Carina Curto,Jesse Geneson,Katherine Morrison
Carina Curto
Combinatorial threshold-linear networks (CTLNs) are a special class of recurrent neural networks whose dynamics are tightly controlled by an underlying directed graph. Recurrent networks have long been used as models for associative memory ...
Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees [0.03%]
棒状物种树与p-伪棒状基因树的谱系历史 Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees
Egor Alimpiev,Noah A Rosenberg
Egor Alimpiev
For a fixed set X containing n taxon labels, an ordered pair consisting of a gene tree topology G and a species tree topology S bijectively labeled with the labels of X possesses a set of coalescent histories-mappings from the set of intern...
Toufik Mansour,Reza Rastegar,Alexander Roitershtein
Toufik Mansour
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size n. Our main results are formulas expressing the expected degree of graph nodes in t...
Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees [0.03%]
被路障阻隔的单调路径以及不匹配的毛毛虫基因树和物种树的共聚历史的枚举问题
Zoe M Himwich,Noah A Rosenberg
Zoe M Himwich
Given a gene tree topology and a species tree topology, a coalescent history represents a possible mapping of the list of gene tree coalescences to associated branches of a species tree on which those coalescences take place. Enumerative pr...
ENUMERATION OF LONELY PAIRS OF GENE TREES AND SPECIES TREES BY MEANS OF ANTIPODAL CHERRIES [0.03%]
利用对极樱桃枚举基因树和物种树的孤偶数对
Noah A Rosenberg
Noah A Rosenberg
In mathematical phylogenetics, given a rooted binary leaf-labeled gene tree topology G and a rooted binary leaf-labeled species tree topology S with the same leaf labels, a coalescent history represents a possible mapping of the list of gen...
RECOVERING A TREE FROM THE LENGTHS OF SUBTREES SPANNED BY A RANDOMLY CHOSEN SEQUENCE OF LEAVES [0.03%]
从由随机选择的叶节点序列生成的子树长度恢复树结构
Steven N Evans,Daniel Lanoue
Steven N Evans
Given an edge-weighted tree T with n leaves, sample the leaves uniformly at random without replacement and let Wk , 2 ≤ k ≤ n, be the length of the subtree spanned by the first k leaves. We consider the question, "Can T be identified (up ...
Graph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems [0.03%]
图论中一般化学反应系统注入性及唯一平衡性的判据
Murad Banaji,Gheorghe Craciun
Murad Banaji
In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chem...