ADVANCES IN APPLIED MATHEMATICS
ADVANCES IN APPLIED MATHEMATICS(英文缩写 ADV APPL MATH),ISSN 0196-8858,eISSN 1090-2074 是一本学术期刊。本页汇总该期刊的最新影响因子、分区信息以及最新收录于 PubMed 的文献,帮助您快速了解期刊全貌。
指标来源:jcr_cas_ifqb
期刊简介
暂无简介。
历年影响因子趋势
| 年份 | 影响因子 | JCR 分区 |
|---|---|---|
| - | Q3 | |
| - | Q3 | |
| - | Q3 | |
| - | Q2 | |
| - | Q2 |
ADVANCES IN APPLIED MATHEMATICS 最新收录文献
-
Geometry of the space of phylogenetic trees with non-identical leaves.
Phylogenetic trees summarize evolutionary relationships. The Billera-Holmes-Vogtmann (BHV) space for comparing phylogenetic trees has many elegant mathematical properties, but it does not encompass tr…
-
Stable fixed points of combinatorial threshold-linear networks.
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 bee…
-
{"_":"Enumeration of coalescent histories for caterpillar species trees and -pseudocaterpillar gene trees.","i":["p"]}
For a fixed set containing taxon labels, an ordered pair consisting of a gene tree topology and a species tree topology bijectively labeled with the labels of possesses a set of coalescent histories-m…
-
Horizontal visibility graph of a random restricted growth sequence.
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and random set partitions of size . Our main results are formulas expressing …
-
Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees.
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…
-
ENUMERATION OF LONELY PAIRS OF GENE TREES AND SPECIES TREES BY MEANS OF ANTIPODAL CHERRIES.
In mathematical phylogenetics, given a rooted binary leaf-labeled gene tree topology and a rooted binary leaf-labeled species tree topology with the same leaf labels, a coalescent history represents a…
-
RECOVERING A TREE FROM THE LENGTHS OF SUBTREES SPANNED BY A RANDOMLY CHOSEN SEQUENCE OF LEAVES.
Given an edge-weighted tree with leaves, sample the leaves uniformly at random without replacement and let , 2 ≤ ≤ , be the length of the subtree spanned by the first leaves. We consider the question,…
-
Graph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems.
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 const…