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 21 for “"labeled trees"”.

  1. Enumeration Results On Leaf Labeled Trees

    ENUMERATION RESULTS ON LEAF LABELED TREES,Virginia P. Johnson In evolutionary biology, it is common practice to represent the evolution of species, populations, and organisms with graphs, called phylogenetic or species trees. These are rooted leaf-labeled trees where non-root internal vertices have …

    south-carolina Repository record for Enumeration Results On Leaf Labeled Trees (opens in a new tab)

  2. DISSIMILARITY MEASURES FOR COMPARISON OF LABELED TREES AND DAGS

    … parts. The first part studies the comparison of labeled trees, a class of models that includes mutation trees used to describe tumor evolution in cancer biology. Mutation trees are crucial for understanding cancer progression, and central challenges involve inferring them from patient sequencing …

    nus Repository record for DISSIMILARITY MEASURES FOR COMPARISON OF LABELED TREES AND DAGS (opens in a new tab) Download file for DISSIMILARITY MEASURES FOR COMPARISON OF LABELED TREES AND DAGS (opens in a new tab)

  3. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications

    … exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type …

    gsu Repository record for Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications (opens in a new tab)

  4. Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees

    … weighted binary relations and weighted multi-labeled trees. We propose adaptive algorithms to solve these queries and prove the measures of the complexity of these algorithms in terms of the high-level operations. We describe how these algorithms can be implemented and derive the upper bounds …

    waterloo Repository record for Adaptive Algorithms for Weighted Queries on Weighted Binary Relations and Labeled Trees (opens in a new tab)

  5. An approximate search engine for structure

    … search techniques are presented for retrieving trees from a database that are similar to a given query tree. Rooted ordered labeled trees, rooted unordered labeled trees and free trees are considered. Ordered labeled trees are trees in which each node has a label and the left-to-right order …

    njit Repository record for An approximate search engine for structure (opens in a new tab)

  6. Succinct Indexes

    … types, namely strings, binary relations, multi-labeled trees and multi-labeled graphs, as well as succinct text indexes. For strings, binary relations and multi-labeled trees, when the operators in the ADTs are supported in constant time, our results are comparable to previous results, while …

    waterloo Repository record for Succinct Indexes (opens in a new tab)

  7. Consensus Algorithms for Trees and Strings

    … combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. The thesis is divided into three parts. In the first part, we study some problems in …

    lund Repository record for Consensus Algorithms for Trees and Strings (opens in a new tab) Download PDF for Consensus Algorithms for Trees and Strings (opens in a new tab)

  8. Managing and analyzing phylogenetic databases

    … are now producing enormous collections of trees that vary greatly in size. Our proposed research addresses the challenges posed by storing, querying, and analyzing such phylogenetic databases.</p> <p>Our first contribution is the further development of STBase, a phylogenetic tree database …

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

  9. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

    … occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XML documents, and posting lists in search engines. The main emphasis of this thesis is on lower bounds for time-space tradeoffs …

    waterloo Repository record for Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures (opens in a new tab)

  10. Compatibility testing for rooted phylogenetic trees

    … a way to synthesize a collection of phylogenetic trees with partially overlapping taxon sets into a single supertree that represents the information in the input trees. The supertree approach, proposed in the early 90s [5, 6], has been used successfully to build large-scale phylogenies [7].</p> …

    iastate Repository record for Compatibility testing for rooted phylogenetic trees (opens in a new tab)

  11. Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs

    … 4, we study a Ramsey-type problem on edge-labeled trees, where we seek subtrees that have a small number of path-labels. In Chapter 5, we examine parity edge-colorings, which have connections to additive combinatorics and the minimum dimension of a hypercube in which a tree embeds. In …

    uiuc Repository record for Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs (opens in a new tab)

  12. Pattern discovery in trees : algorithms and applications to document and scientific data management

    Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology and natural language processing. In this dissertation we present algorithms for …

    njit Repository record for Pattern discovery in trees : algorithms and applications to document and scientific data management (opens in a new tab)

  13. A peer distributed web caching system with incremental update scheme

    … problem by transforming web objects into ordered labeled trees. This thesis discusses the solutions to the minimal patch generation problem with dynamic or fixed instruction set. Various patch generation algorithms are developed and evaluation experiments are conducted. Results show that most …

    nus Repository record for A peer distributed web caching system with incremental update scheme (opens in a new tab) Download file for A peer distributed web caching system with incremental update scheme (opens in a new tab)

  14. A data science approach to pattern discovery in complex structures with applications in bioinformatics

    … representing RNA secondary structures as ordered labeled trees and performs tree pattern discovery using a quadratic time dynamic programming algorithm. The algorithm is able to identify and extract the largest common substructures from two RNA molecules of different sizes, without prior knowledge …

    njit Repository record for A data science approach to pattern discovery in complex structures with applications in bioinformatics (opens in a new tab)

  15. Pattern discovery in structural databases with applications to bioinformatics

    … frequently occurring in structural data such as trees and graphs. FSM finds many applications in bioinformatics, XML processing, Web log analysis, and so on. In this thesis, two new FSM techniques are proposed for finding patterns in unordered labeled trees. Such trees can be used to model …

    njit Repository record for Pattern discovery in structural databases with applications to bioinformatics (opens in a new tab)

  16. Urban Roadside Tree Inventory Using a Mobile Laser Scanning System

    … to extract geometrical information of roadside trees from the MLS-acquired point clouds. The workflow developed in this study consists of three parts. The first part deals with ground point removal. As such, only off-ground points are used to extract trees. The second part handles tree detection …

    waterloo Repository record for Urban Roadside Tree Inventory Using a Mobile Laser Scanning System (opens in a new tab)

  17. Algorithms for constructing more accurate and inclusive phylogenetic trees

    … and show that it yields more accurate supertrees than those obtained from Matrix Representation with Parsimony (MRP) and rooted RF heuristic. In the second, I present an RF distance measure based approach (MulRF) for inferring a species tree from the input multi-copy gene trees, through a …

    iastate Repository record for Algorithms for constructing more accurate and inclusive phylogenetic trees (opens in a new tab)

  18. Cuts and Partitions in Graphs/Trees with Applications

    … agreement forest problem and the multicut on trees problem are NP-hard, thus cannot be solved efficiently if P /=NP. The maximum agreement forest problem was motivated in the study of evolution trees in bioinformatics, in which we are given two leaf-labeled trees and are asked to find a …

    tamu Repository record for Cuts and Partitions in Graphs/Trees with Applications (opens in a new tab)

  19. In-Memory Storage for Labeled Tree-Structured Data

    … thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size w, which permits random accesses to w-bit memory cells. Our data structures are …

    waterloo Repository record for In-Memory Storage for Labeled Tree-Structured Data (opens in a new tab)

  20. Trees, Partitions, and Other Combinatorial Structures

    … S and their length. If the leaves of a star are labeled with the strings in S, then Z(x!, S) counts the pairs of functions where one selects a median μ for S and the other assigns, to each v belongs to S, a permutation of coordinates in which μ and v differ. This relates to the small parsimony …

    south-carolina Repository record for Trees, Partitions, and Other Combinatorial Structures (opens in a new tab)

Page 1 of 2