Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 68 for “"Subtrees"”.

  1. Club Isomorphisms between Subtrees of Aronszajn Trees

    … normal Aronszajn trees contain club isomorphic subtrees.

    unt Repository record for Club Isomorphisms between Subtrees of Aronszajn Trees (opens in a new tab)

  2. Counting Subtrees Using the Chromatic Symmetric Function

    … and Wagner showed in 2006 that the number of subtrees isomorphic to paths and stars can be obtained linearly from the coefficients of the chromatic symmetric function in the power-sum basis. We will use some of the techniques in Chapter 3 to show that the number of subtrees isomorphic to forks …

    ku Repository record for Counting Subtrees Using the Chromatic Symmetric Function (opens in a new tab)

  3. Lifeforms and the Environment: A Study of Sonoran Desert Subtrees on Bajadas

    … patterns of distribution of Sonoran desert subtrees were studied on four bajadas along a southward gradient of increasing moisture. Subtrees are non-riparian desert trees, generally small in stature but having a definite trunk. Percent vegetation cover (m2 of plant canopy/10000 m2) and …

    utahstate Repository record for Lifeforms and the Environment: A Study of Sonoran Desert Subtrees on Bajadas (opens in a new tab)

  4. Subtree moments in random phylogenetic trees

    … under these two models through the lens of subtrees, which are small recurring structures inside trees. Through a recursive approach, we obtain exact results for the joint and marginal statistical distributions of subtrees in trees generated under both models, in both rooted and unrooted …

    east-anglia Download PDF for Subtree moments in random phylogenetic trees (opens in a new tab)

  5. Grafos ORTH[h, s, t] /

    … this thesis we study the intersection graphs of subtrees of a tree. More precisely we will present results on the class of graphs ORTH[h, s, t]. The graphs that belong to this class are those that admit a representation by intersection of subtrees of a host tree, in which the maximum degree of …

    brazil-uerj Repository record for Grafos ORTH[h, s, t] / (opens in a new tab)

  6. Structure and content semantic similarity detection of eXtensible markup language documents using keys

    … Using Keys) that clusters XML documents into subtrees using leaf-node parents as clustering points. This algorithm matches subtrees using the key concept and compares unmatched subtrees for similarities in both content and structure. The experimental results show that this approach finds much …

    must-thes Repository record for Structure and content semantic similarity detection of eXtensible markup language documents using keys (opens in a new tab)

  7. Managing and analyzing phylogenetic databases

    … upon an existing approach based on frequent subtrees and, propose two new approaches based on agreement subtrees and frequent subtrees respectively.</p> <p>The final part of our proposed work deals with the problem of simplifying multi-labeled trees and handling "rogue" taxa. We propose a …

    iastate Repository record for Managing and analyzing phylogenetic databases (opens in a new tab)

  8. Graphical Indices and their Applications

    … index, the degree distance, and the number of subtrees. We find which structure will maximize the Randić index of a class of graphs known as cacti, and we find a functional relationship between the Wiener index and the degree distance for several types of graphs. We also develop an algorithm to …

    gsu Repository record for Graphical Indices and their Applications (opens in a new tab)

  9. Sparse Trees with a Given Degree Sequence

    … maximum Wiener index and the minimum number of subtrees at the same time. Wiener index is one of the most important topological indices in chemical graph theory. Steiner k�� Wiener index can be regarded as the generalization of Wiener index, when k = 2, Steiner Wiener index is the same as Wiener …

    gsu Repository record for Sparse Trees with a Given Degree Sequence (opens in a new tab)

  10. Flexible Congestion Management for Error Reduction in Wireless Sensor Networks

    … improved to re-balance the network traffic of subtrees such that subtrees whose measurements have lower variance may decrease their output rates while subtrees whose measurements have higher variance may increase their output rates, while still addressing all congestion in the network. We …

    clemson Repository record for Flexible Congestion Management for Error Reduction in Wireless Sensor Networks (opens in a new tab)

  11. On the Conjugacy Problem for Automorphisms of Trees

    … all cases that the complexity of isomorphism of subtrees of a given regular countable tree is the same as the complexity of conjugacy of automorphisms of the same tree, though we present an example for which this does not hold.

    boise Repository record for On the Conjugacy Problem for Automorphisms of Trees (opens in a new tab)

  12. On the study of tree pattern matching algorithms and applications

    … work by identifying clones even when arbitrary subtrees have been changed. On a 440,000-line code corpus, 20-50% of the clones found eluded previous methods.

    ubc Repository record for On the study of tree pattern matching algorithms and applications (opens in a new tab) Download PDF for On the study of tree pattern matching algorithms and applications (opens in a new tab)

  13. Graph representations using stars, trees, intervals and boxes

    … the intersection graph of unions of t substars (subtrees) of a host tree. We characterize the graphs with star number 1 and prove that a planar graph has star number at most 3. We study bounds on these two parameters and compare them with interval number. We prove that the star number is at most …

    uiuc Repository record for Graph representations using stars, trees, intervals and boxes (opens in a new tab)

  14. Graphic display and manipulation of tree-type data structures.

    … keyboard and cards, adding and deleting subtrees in existing trees, and saving and retrieving trees. Trees may be passed between TREEPAK and the user written main program. An implementation of the Wang Algorithm is given as an example application program.

    nps Repository record for Graphic display and manipulation of tree-type data structures. (opens in a new tab)

  15. Novel Evaluation Methods for Complex Systems via Adaptive Sequential Exploration of Variables Interactions

    … construct piecewise multidimensional surfaces or subtrees. Each method then used a specific approach to project the results within the subtrees. The fourth method is an expansion to an existing method to explore any order of interactions through the introduction of a new domain of parameters. …

    tamu Repository record for Novel Evaluation Methods for Complex Systems via Adaptive Sequential Exploration of Variables Interactions (opens in a new tab)

  16. Discovering frequent weak XML patterns

    … FOR DISCOVERY OF FREQUENT UNORDERED AND EMBEDDED SUBTREES WITHOUT LOSS. THE ALGORITHM SUCCESSFULLY DOWNGRADES THE COMPLEXITY OF PATTERN MATCHING AND COUNTING PROBLEM THAT A REGULAR TREE MINING ALGORITHM FACES. EXPERIMENTAL RESULTS DEMONSTRATE THE HIGH EFFICIENCY AND SCALABILITY OF WTIMINER IN …

    nus Repository record for Discovering frequent weak XML patterns (opens in a new tab) Download file for Discovering frequent weak XML patterns (opens in a new tab)

  17. Identifying similar code fragments in Haskell

    … fragments. The LCS algorithm is used to compare subtrees of different syntactic variants. Experiments showed that these algorithms can help better evaluate code fragments to identify duplicates.

    uiuc Repository record for Identifying similar code fragments in Haskell (opens in a new tab)

  18. Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents

    … can be utilized not only for enumerating ordered subtrees but also for enumerating unordered subtrees and subsequences. Furthermore, the framework tackles the unprecedented complexity in mining frequent tree-structured patterns by generating only valid candidates with non-zero frequency count and …

    uts Repository record for Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents (opens in a new tab)

  19. Efficient search of general and-or keyword queries in XML data

    … divided into several subqueries in the form of subtrees in the query tree, but also the processing can be broken up and specialized according to the type of the query nodes. By delivering to the parent node the intermediate results immediately when a new one is produced, a pipeline is built in …

    nus Repository record for Efficient search of general and-or keyword queries in XML data (opens in a new tab) Download file for Efficient search of general and-or keyword queries in XML data (opens in a new tab)

  20. Banach Spaces on Topological Ramsey Structures

    … [6]. Finite approximations of the isomorphic subtrees are utilised in constructing the norm. The subspace on each “branch” of the tree is shown to resemble the structure of an ℓ∞n+1 -space where the dimension corresponds to the number of terminal nodes on that branch. The Banach space T1(d, θ) …

    denver Repository record for Banach Spaces on Topological Ramsey Structures (opens in a new tab)

Page 1 of 4