Results 281 to 290 of about 439,865 (314)
Some of the next articles are maybe not open access.
An evolutionary tree for invertebrate globin sequences
Journal of Molecular Evolution, 1988A phylogenetic tree was constructed from 245 globin amino acid sequences. Of the six plant globins, five represented the Leguminosae and one the Ulmaceae. Among the invertebrate sequences, 7 represented the phylum Annelida, 13 represented Insecta and Crustacea of the phylum Arthropoda, and 6 represented the phylum Mollusca. Of the vertebrate globins, 4
M, Goodman +8 more
openaire +2 more sources
On the loopless generation of binary tree sequences
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Enumerative sequences of leaves in rational trees
1997We prove that any IN-rational sequence s=(s n )n≥1 of non-negative integers satisfying the Kraft strict inequality \(\sum\nolimits_{n \geqslant 1} {s_n k^{ - n} } < 1\)is the enumerative sequence of leaves by height of a rational k-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.
Bassino, Frédérique +2 more
openaire +2 more sources
Encoding Trees by Linear Recurrence Sequences
Cybernetics and Systems Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Disjoint Representation of Tree Realizable Sequences
SIAM Journal on Applied Mathematics, 1974A necessary and sufficient condition is obtained for the edge disjoint tree realization of two degree sequences each of which is tree realizable. The condition is that the sum sequence be graphical.
openaire +2 more sources
On the status sequences of trees
2018The status of a vertex v in a connected graph is the sum of the distances from v to all other vertices. The status sequence of a connected graph is the list of the statuses of all the vertices of the graph. In this paper we investigate the status sequences of trees. Particularly, we show that it is NP-complete to decide whether there exists a tree that
Abiad Monge, Aida +2 more
openaire +1 more source
Tree Memory Networks for Sequence Processing
2019Long-term dependencies are difficult to learn using Recurrent Neural Networks due to the vanishing and exploding gradient problems, since their hidden transform operation is applied linearly in sequence length. We introduce a new layer type (the Tree Memory Unit), whose weight application scales logarithmically in the sequence length.
Frederik Diehl, Alois C. Knoll
openaire +1 more source
Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees
Reliability Engineering & System Safety, 2011Abstract A large attention has been focused on the Dynamic Fault Trees in the past few years. By adding new gates to static (regular) Fault Trees, Dynamic Fault Trees aim to take into account dependencies among events. Merle et al. proposed recently an algebraic framework to give a formal interpretation to these gates.
openaire +1 more source
nTreeClus: A tree-based sequence encoder for clustering categorical series
Neurocomputing, 2022Hadi Jahanshahi +1 more
exaly
Animals, Trees and Renewal Sequences
IMA Journal of Applied Mathematics, 1981Rands, B. M. I., Welsh, D. J. A.
openaire +1 more source