Sökning: "Suffix Tree"

Hittade 3 avhandlingar innehållade orden Suffix Tree.

  1. 1. 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

  3. 2. Studies in Applied Data Structures

    Författare :Kurt Swanson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; Sparse Matrix; Suffix Tree; Roundness; Range searching; Data- och systemvetenskap; computer technology;

    Sammanfattning : The design of efficient data structures is of primary importance in creation of theoretical algorithms as well their more tangible descendants, computer programs. In this dissertation we study computational aspects of data structures and their respective algorithms from a theoretical viewpoint, which are however of direct importance in the implementation of solutions for real-world problems. LÄS MER

  4. 3. Inferring evolution in bacteria using Markov chains and genomic signatures

    Författare :Daniel Dalevi; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Prediction suffix tree; Markov chains; Molecular evolution; Bioinformatics; Gene order rearrangements; Horizontal gene transfer; Variable length Markov chains;

    Sammanfattning : This thesis concerns the development of methods and models in evolutionary molecular biology. The techniques are also applicable to other similar biological problems. The first contribution is a novel classifier using fixed and variable length Markov chains that can discriminate between bacterial DNA of different species. LÄS MER