Search results for "Tree"
showing 10 items of 1841 documents
Genetic Improvement of Sweet Chestnut in Sicily (Castanea sativa Mill.) by the Selection of Superior Autochthonous Genotypes
2010
In Sicily, the chestnut (Castanea sativa Mill.) grows in limited areas of the South eastern Mt. Etna volcano and of the Northern Mountains, namely Madonie and Nebrodi. In the Island, chestnut can be considered as a neglected species, because of the modest importance recognized to it for horticultural and forestry exploitation. Recently, the Sicilian regional government founded the 'Horticultural Forestry' project to promote the cultivation of chestnut as possible fruit tree for local city farmer markets, where typical products are usually sold. The project was developed in five steps, carried out during three years by the Dipartimento di Colture Arboree of Palermo University: identification…
Plant facilitation and phylogenetics
2013
The relationship between facilitation and evolutionary ecology is poorly understood. We review five issues elucidating how the phylogenetic relatedness of species provides insight into the role of facilitation in community assembly: (a) Are the facilitative interactions more common between species that differ in a regeneration niche? (b) Are facilitative interactions more common between distantly related species? (c) Do communities governed by facilitation (rather than competition) have higher phylogenetic diversity? (d) As facilitated juvenile plants mature, do they compete with their nurses more often if they are closely related to them? (e) How does the phylogenetic signature in a commun…
Weak associativity and restricted rotation
2009
A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.
Stochastic Processes on Ends of Tree and Dirichlet Forms
2016
We present main ideas and compare two constructions of stochastic processes on the ends (leaves) of the trees with varying numbers of edges at the nods. In one of them the trees are represented by spaces of numerical sequences and the processes are obtained by solving a class of Chapman-Kolmogorov Equations. In the other the trees are described by the set of nodes and edges. To each node there is naturally associated a finite dimensional function space and the Dirichlet form on it. Having a class of Dirichlet forms at the nodes one can under certain conditions build a Dirichlet form on L2 space of funcions on the ends of the trees. We show that the state spaces of two approaches are homeomo…
On the construction of classes of suffix trees for square matrices: Algorithms and applications
1995
Given an n × n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4n−1 classes of index data structures for TEXT. Those indices are informally the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on TEXT. We provide one simple algorithm that efficiently builds any chosen index in those classes in O(n2 log n) worst case time using O(n2) space. The algorithm can be modified to require optimal O(n2) expected time for bounded σ.
When can an equational simple graph be generated by hyperedge replacement?
1998
Infinite hypergraphs with sources arise as the canonical solutions of certain systems of recursive equations written with operations on hypergraphs. There are basically two different sets of such operations known from the literature, HR and VR. VR is strictly more powerful than HR on simple hypergraphs. Necessary conditions are known ensuring that a VR-equational simple hypergraph is also HR-equational. We prove that two of them, namely having finite tree-width or not containing the infinite bipartite graph, are also sufficient. This shows that equational hypergraphs behave like context-free sets of finite hypergraphs.
Irredundant tandem motifs
2014
Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings {m1, m2} occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that h…
Complexity of decision trees for boolean functions
2004
For every positive integer k we present an example of a Boolean function f/sub k/ of n = (/sub k//sup 2k/) + 2k variables, an optimal deterministic tree T/sub k/' for f/sub k/ of complexity 2k + 1 as well as a nondeterministic decision tree T/sub k/ computing f/sub k/. with complexity k + 2; thus of complexity about 1/2 of the optimal deterministic decision tree. Certain leaves of T/sub k/ are called priority leaves. For every input a /spl isin/ {0, 1}/sup n/ if any of the parallel computation reaches a priority leaves then its label is f/sub k/ (a). If the priority leaves are not reached at all then the label on any of the remaining leaves reached by the computation is f/sub k/. (a).
A Group-theoretical Finiteness Theorem
2008
We start with the universal covering space $${\*M^n}$$ of a closed n-manifold and with a tree of fundamental domains which zips it $${T\longrightarrow\*M^n}$$ . Our result is that, between T and $${\* M^n}$$ , is an intermediary object, $${T\stackrel{p} {\longrightarrow} G \stackrel{F}{\longrightarrow} \*M^n}$$ , obtained by zipping, such that each fiber of p is finite and $${T\stackrel{p}{\longrightarrow}G\stackrel{F}{\longrightarrow} \*M^n}$$ admits a section.
Ranking and unrankingk-ary trees with a 4k –4 letter alphabet
1997
Abstract The problem of the direct generation in A-order of binary trees was stated by Zaks in 1980. In 1988 Roelants van Baronaigien and Ruskey gave a solution for k-ary trees with n internal nodes using an encoding sequence of kn+1 integers between 1 and n. Vajnovszki and Pallo improved this result for binary trees in 1994 using words of length n–1 on a four letter alphabet. Recently Korsh generalized the Vajnovszki and Pallo’s generating algorithm to k-ary trees using an alphabet whose cardinality depends on k but not on n. We give in this paper ranking and unranking algorithms for k-ary trees using the Korsh’s encoding scheme.