Springer Science and Business Media LLC
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
The enumeration of minimal phylograms
Springer Science and Business Media LLC - Tập 35 - Trang 525-533 - 1973
We consider the problem of finding a minimal tree to a set of nodes (of species
represented byd characters) in a space ofd-dimensions subject to the hypothesis
that evolution is nonconvergent and irreversible. A solution to this problem is
formulated, using integer linear programming techniques.
Phylogenetic Networks with Every Embedded Phylogenetic Tree a Base Tree
Springer Science and Business Media LLC - Tập 78 - Trang 132-137 - 2015
We show that the class of tree-child networks is precisely the class of
tree-based networks with the property that every embedded phylogenetic tree is a
base tree.
The problem of time unit in Leslie’s population model
Springer Science and Business Media LLC - Tập 42 - Trang 719-728 - 1980
The conditions that will allow the lumping together of several age classes in
the Leslie model are investigated. We show that if the lumping is to be valid
for all population distributions, then the parameters of the model must be
periodic. Lumping is valid when the population is in equilibrium, but
equilibrium should be tested before the model is lumped.
On biomass diversity in ecology
Springer Science and Business Media LLC - Tập 45 - Trang 287-293 - 1983
Generation of Orchard and Tree-Child Networks
Springer Science and Business Media LLC - Tập 86 - Trang 1-18 - 2023
Phylogenetic networks are an extension of phylogenetic trees that allow for the
representation of reticulate evolution events. One of the classes of networks
that has gained the attention of the scientific community over the last years is
the class of orchard networks, that generalizes tree-child networks, one of the
most studied classes of networks. In this paper we focus on the combinatorial
and...
Checkpoint method for choice recovery in dynamic programming
Springer Science and Business Media LLC - Tập 67 - Trang 719-736 - 2005
Many dynamic programming algorithms consist of a ‘forward pass’ computation to
optimize a cost function, followed by a ‘choice recovery’ computation to
construct a configuration that optimizes the cost function. ‘Checkpointing’ is a
method to perform choice recovery using limited storage. During a forward pass,
checkpoints in an optimal configuration are identified. Then recursion is used
to fill ...
Glucose metabolism—A “mixed-cycle” system
Springer Science and Business Media LLC - Tập 23 - Trang 99-103 - 1961
Emphasis upon the importance of homeostatic feedback has drawn attention away
from the complexity of biological processes. A study of glucose metabolism
indicates the importance of open-cycle as well as closed-cycle mechanisms.
Besides the glucose-dependent mechanism of insulin secretion, many open-cycle
processes involving the liver, adrenal glands and kidneys, play important roles
in the variati...
On the form and strength of trees: Part III. The secondary branches and their relation to the primary branches
Springer Science and Business Media LLC - Tập 7 - Trang 1-4 - 1945
The secondary branches are considered in this note mainly for the purpose of
applying the principle of maximum strength to the primary branches.
Entropy balance of white-tailed deer during a winter night
Springer Science and Business Media LLC - Tập 49 Số 3 - Trang 321-327 - 1987
Conditions for global stability of two-species population models with discrete time delay
Springer Science and Business Media LLC - Tập 45 - Trang 793-805 - 1983
Tổng số: 4,518
- 1
- 2
- 3
- 4
- 5
- 6
- 10