Results 11 to 20 of about 598,821 (278)
Selection of Pinus pinea L. plus tree candidates for cone production [PDF]
Multivariate statistical analysis was used to define different developmental stages for stone pine (Pinus pinea L.) considering tree size and cone production, without site-specific information. * This was achieved in two steps. First, trees from permanent plots were classified using cluster analysis in five different stages.
Isabel Carrasquinho +2 more
exaly +3 more sources
Genetic Evaluation by Microsatellite Loci of Pinus sylvestris L. Plus Trees
In this study, a comparative analysis was performed to estimate the genetic diversity levels of Pinus sylvestris L. in 49 seed orchards of I generation and progeny test plantings using 4-nucleus microsatellite loci.
Boris V. Raevsky, Alexey A. Ilinov
doaj +2 more sources
Finite Sequentiality of Unambiguous Max-Plus Tree Automata [PDF]
AbstractWe show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree ...
openaire +4 more sources
GENETIC AND BREEDING ASSESSMENT OF SCOTS PINE PLUS TREES IN KARELIA
Growth and survival of 123 grafted and half-sib Scots pine (Pinus sylvestris L.) progenies have been investigated in a 1st generation seed orchard and progeny tests of variousages.
Boris Raevsky +2 more
doaj +1 more source
Oakwood and plus trees common oakfruiting [PDF]
The objects of research were the groves of the Central Chernozem and plus trees selected in them. Oakwood in the re-gion has long been intensively exploited, their area reduced by 2-3 times, and the gene pool is severely malnourished. Restor-ing oak occurs very difficult with large omissions and economic costs.
Viktor Shirnin +3 more
openaire +1 more source
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]
AbstractWe show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant.
openaire +4 more sources
Mplus Trees: Structural Equation Model Trees Using Mplus
Structural equation model trees (SEM Trees) allow for the construction of decision trees with structural equation models fit in each of the nodes.
Sarfaraz Serang +5 more
openaire +2 more sources
Molecular marker-based characterization of ecuadorian dry forest tamarind plus trees
To improve the potential of tamarind as an economically valued domesticated species it is important to characterize its variability in Ecuador for breeding purposes.
Leidy Sarmiento +4 more
doaj +1 more source
Grafting induces precocity and maintains clonal integrity in fruit tree crops. However, the complex rootstock × scion interaction often precludes understanding how the tree phenotype is shaped, limiting the potential to select optimum rootstocks ...
Gloria Patricia Cañas-Gutiérrez +5 more
doaj +1 more source
Unambiguous Separators for Tropical Tree Automata [PDF]
In this paper we show that given a max-plus automaton (over trees, and with real weights) computing a function f and a min-plus automaton (similar) computing a function g such that f ?
Colcombet, Thomas, Lombardy, Sylvain
core +3 more sources

