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 29 for “"suffix trees"”.

  1. Suffix Trees for Document Retrieval

    This thesis presents a look at the suitability of Suffix Trees for full text indexing and retrieval. Typically suffix trees are built on a character level, where the tree records which characters follow each other character. By building suffix trees for documents based on words instead of …

    calpoly Repository record for Suffix Trees for Document Retrieval (opens in a new tab)

  2. Suffix trees for very large inputs

    A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than their input sequences …

    uvic Repository record for Suffix trees for very large inputs (opens in a new tab)

  3. Management of biological sequences using suffix trees

    … of sophisticated indexing techniques. Recently, suffix tree (ST) and suffix array (SA) received considerable attention as suitable data structures in this context. However, existing solutions often focus on either efficiency or scalability, but not both. Further, some of the solutions require …

    concordia Download PDF for Management of biological sequences using suffix trees (opens in a new tab)

  4. The Longest Common Subsequence via Generalized Suffix Trees

    … longest common subsequence using the generalized suffix tree and directed acyclic graph.;The Generalized suffix tree (GST) is the combined suffix tree for a set of strings {lcub}S1, S 2, ..., Sn{rcub}. Both the suffix tree and the generalized suffix tree can be calculated in linear time and linear …

    wvu Repository record for The Longest Common Subsequence via Generalized Suffix Trees (opens in a new tab)

  5. Enhanced Suffix Trees for Very Large DNA Sequences

    … scalable, and versatile processing of such data. Suffix tree (ST) is a data structure used for indexing genome data. This, however, comes with a price: it occupies a space that is about 10 times more than the input size. Existing disk-based ST index techniques either suffer from data skew problem, …

    concordia Download PDF for Enhanced Suffix Trees for Very Large DNA Sequences (opens in a new tab)

  6. Real-time video compression using DVQ and suffix trees

    … of differential vector quantization and the suffix tree. Differential vector quantization is a relatively new area that focuses on efficient compression of data. The present work integrates the compression provided by Differential vector Quantization and the speed achieved by using the suffix …

    wvu Repository record for Real-time video compression using DVQ and suffix trees (opens in a new tab)

  7. Approximate String Matching With Dynamic Programming and Suffix Trees

    … data structure in string algorithms, the suffix tree. The lowest common ancestor extension of the suffix tree is the key to many advanced string matching algorithms. With these tools, we are able to solve string problems that were, until recently, thought intractable by many. Another …

    unf Repository record for Approximate String Matching With Dynamic Programming and Suffix Trees (opens in a new tab) Download PDF for Approximate String Matching With Dynamic Programming and Suffix Trees (opens in a new tab)

  8. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees

    The music industry was the first mass-media industry to be transformed by the transition to digital. Today, music consumers have access to personal libraries, subscription-based libraries, and online content via web-media hosts or channels. Now more than ever, there are tremendous quantities of …

    guelph Repository record for Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees (opens in a new tab)

  9. Suffix trees and suffix arrays in primary and secondary storage

    … To speed up the runtime of these algorithms, suffix trees and suffix arrays are routinely used to generate a set of starting positions quickly and/or narrow down the set of possibilities need to be considered.;The first contribution of this dissertation is a linear time algorithm to sort all …

    iastate Repository record for Suffix trees and suffix arrays in primary and secondary storage (opens in a new tab)

  10. Probabilistic Suffix Models for Windows Application Behavior Profiling: Framework and Initial Results

    … a framework for employing probabilistic suffix models as a means of constructing behavior profiles from code-traces of Windows XP applications. Emphasis is placed on the inference and use of probabilistic suffix trees and automata with new contributions in the area of auxiliary symbol …

    ut-knoxville Repository record for Probabilistic Suffix Models for Windows Application Behavior Profiling: Framework and Initial Results (opens in a new tab)

  11. Parallel and scalable combinatorial string algorithms on distributed memory systems

    … and the use of large computing clusters. Suffix arrays and trees are fundamental string data structures, which lie at the foundation of many string algorithms, with important applications in text processing, information retrieval, and computational biology. Conversely, the parallel …

    gatech Repository record for Parallel and scalable combinatorial string algorithms on distributed memory systems (opens in a new tab)

  12. Generic Reinforcement Learning Beyond Small MDPs

    … The current state-of-the-art in FRL uses suffix trees which have issues with large observation spaces and long-term dependencies. We start by addressing the issue of long-term dependency using a class of maps known as looping suffix trees, which have previously been used to represent …

    anu Repository record for Generic Reinforcement Learning Beyond Small MDPs (opens in a new tab)

  13. Biological Sequence Indexing Using Persistent Java

    … with an empirical evaluation of disk-resident suffix indexes. This methodology allowed us to develop a practical algorithm for the construction of suffix trees on disk up to any size supported by the available file and addressing space, which has hitherto not been possible. The third …

    glasgow Download PDF for Biological Sequence Indexing Using Persistent Java (opens in a new tab)

  14. SPARTA: A Graphical User Interface for Malicious Mobile Code Fingerprint-ing.

    … Profiling Application for the Rendering of Trees and Automata), a graphical user interface used as a front end to a collection of tools written in C that collectively convert a log of registry system calls performed by an application into binary descriptions of PSTs (for Probabilistic Suffix …

    ut-knoxville Repository record for SPARTA: A Graphical User Interface for Malicious Mobile Code Fingerprint-ing. (opens in a new tab)

  15. Finding DNA motifs: A probabilistic suffix tree approach

    … We propose a method based on Probabilistic Suffix Trees (PSTs) to identify fixed-length motifs from a given set of DNA sequences. Our experiments reveal that our approach successfully discovers true motifs. We compared our method with the popular MEME algorithm, and observed that it detects …

    nebraska Repository record for Finding DNA motifs: A probabilistic suffix tree approach (opens in a new tab)

  16. Efficient Data Structures for Text Processing Applications

    … has witnessed many breakthroughs, such as the suffix trees, suffix arrays, FM-index, etc. In this work, we revisit the following problems: 1. The Heaviest Induced Ancestors problem 2. Range Longest Common Prefix problem 3. Range Shortest Unique Substrings problem 4. Non-Overlapping Indexing …

    ucf Repository record for Efficient Data Structures for Text Processing Applications (opens in a new tab)

  17. Efficient and scalable indexing techniques for sequence data management

    … both. We propose two new indexing techniques, Suffix Tree Top-Down 64 bit and Suffix Tree Depth-First 64 bit, which offer a tradeoff between scalable index construction, index size, and support of fast search. They differ in the order in which the index nodes are recorded but have similar …

    concordia Download PDF for Efficient and scalable indexing techniques for sequence data management (opens in a new tab)

  18. Improved Periodicity Mining in Time Series Databases

    … pattern recognition, etc. Recently, the suffix tree, a powerful data structure that efficiently solves many strings related problems has been used to gather information about repeated substrings in the text and then perform periodicity mining. However, periodicity mining deals with large …

    wvu Repository record for Improved Periodicity Mining in Time Series Databases (opens in a new tab)

  19. Suffix Structures and Circular Pattern Problems

    The suffix tree is a data structure used to represent all the suffixes in a string. However, a major problem with the suffix tree is its practical space requirement. In this dissertation, we propose an efficient data structure -- the virtual suffix tree (VST) -- which requires less space than other …

    wvu Repository record for Suffix Structures and Circular Pattern Problems (opens in a new tab)

Page 1 of 2