Sökning: "Tree Algorithms"

Visar resultat 1 - 5 av 108 avhandlingar innehållade orden Tree Algorithms.

  1. 1. Studies in Efficient Discrete Algorithms

    Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

    Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

  3. 2. Constructing Evolutionary Trees - Algorithms and Complexity

    Författare :Anna Östlin; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

  4. 3. Contributions to the theory and applications of tree languages

    Författare :Johanna Högberg; Frank Drewes; Manfred Droste; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; regular tree languages; tree series; algorithmic learning; MAT-learning; bisimulation minimisation; tree-based generation; algorithmic composition; music algebra; Computer science; Datalogi;

    Sammanfattning : This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. LÄS MER

  5. 4. Structures of String Matching and Data Compression

    Författare :N Jesper Larsson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Implementation; Burrows-Wheeler Transform; Sliding Window; Suffix Sorting; Text Compression; Algorithms; Suffix Tree; Systems engineering; computer technology; Data- och systemvetenskap;

    Sammanfattning : This doctoral dissertation presents a range of results concerning efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It comprises both theoretic results and practical implementations. LÄS MER

  7. 5. Tree Structures in Broadcast Encryption

    Författare :Kristin Anderson; Ingemar Ingemarsson; Jacob Löfvenberg; Robert Forchheimer; Ben Smeets; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Broadcast encryption; Subset Difference; tree structure; Information technology; Informationsteknologi;

    Sammanfattning : The need for broadcast encryption arises when a sender wishes to securely distribute messages to varying subsets of receivers, using a broadcast channel, for instance in a pay-TV scenario. This is done by selecting subsets of users and giving all users in the same subset a common decryption key. LÄS MER