Results 41 to 50 of about 3,903,221 (297)
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
, 2017 Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one ...
Engelfriet, Joost +2 more
core +3 more sources
Tree contractions and evolutionary trees [PDF]
SIAM Journal on Computing, 1997 An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species. An agreement subtree of two evolutionary trees is an evolutionary tree which is also a topological subtree
openaire +4 more sources
Deep Tree Net-Vector of Locally Aggregated Descriptor (VLAD) Model
IEEE Access, 2019 In this work, we combined both a tree and a NetVLAD (vector of locally aggregated descriptors) in order to design new deep model. In developing this model, we studied the impact of tree hyperparameters and found that branch factors had major effects on ...
Abduljawad A. Amory +2 more
doaj +1 more source
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source
Chromatic number of super vertex local antimagic total labelings of graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is called a super
Fawwaz F. Hadiputra +4 more
doaj +1 more source
The Rank of Tree-Automatic Linear Orderings [PDF]
, 2012 We generalise Delhomm\'e's result that each tree-automatic ordinal is strictly below \omega^\omega^\omega{} by showing that any tree-automatic linear ordering has FC-rank strictly below \omega^\omega.
Huschenbett, Martin
core +4 more sources
Trees within trees II: Nested fragmentations [PDF]
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2020 Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to the setting of nested partitions, i.e. pairs of partitions $( , )$ where $ $ is finer than $ $.
openaire +3 more sources
Zeroth-order general Randić index of trees with given distance k-domination number
Electronic Journal of Graph Theory and Applications, 2022 The zeroth-order general Randić index of a graph G is defined as Ra(G)=∑v ∈ V(G)dGa(v), where a ∈ ℝ, V(G) is the vertex set of G and dG(v) is the degree of a vertex v in G.
Tomas Vetrik +2 more
doaj +1 more source
Zootaxa, 2014 Are birds dinosaurs? Answers to this question yield various responses, depending on a particular viewpoint. From the perspective of a common understanding of recent theories of the origin of birds and their potential precursor (ancestral) animals, then, yes, birds are a kind of dinosaur, having evolved from one or another non-avian dinosaur (Bostwick ...
Ebach, Malte C., Williams, DM
openaire +3 more sources
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source