Sökning: "Prediction suffix tree"

Hittade 2 avhandlingar innehållade orden Prediction 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. 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