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 60 for “"Suffix tree"”.

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

  2. A disk-resident suffix tree index and generic framework for managing tunable indexes

    … which this index is typical. The Top-Compressed Suffix Tree is a novel data structure that can be used to provide a scalable, disk-resident index for large sequences. This data structure is based on the suffix tree, but has been designed to overcome the problems associated with using such …

    glasgow Download PDF for A disk-resident suffix tree index and generic framework for managing tunable indexes (opens in a new tab)

  3. Suffix Tree, Minwise Hashing and Streaming Algorithms for Big Data Analysis in Bioinformatics

    … three approaches: (a) a streaming model, (b) suffix-tree based indexing, and (c) minwise-hashing (minhash) and locality-sensitive hashing (LSH). The streaming models are useful for large data problems where a good approximation needs to be achieved with limited space usage. We developed an …

    nebraska Repository record for Suffix Tree, Minwise Hashing and Streaming Algorithms for Big Data Analysis in Bioinformatics (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. Succinct Data Structures for Parameterized Pattern Matching and Related Problems

    … ordered alphabet Sigma of size sigma <= n. Suffix tree is the ubiquitous data structure for answering a pattern matching query: report all the positions i in T such that T[i + k - 1] = P[k], 1 <= k <= |P|. Compressed data structures support pattern matching queries, using much lesser space …

    lsu-thes Repository record for Succinct Data Structures for Parameterized Pattern Matching and Related Problems (opens in a new tab)

  6. 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)

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

  8. 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)

  9. 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)

  10. Αποδοτική διαχείριση κειμενικής πληροφορίας: δεικτοδότηση, αποθήκευση, επεξεργασία και εφαρμογές

    … of a string. The algorithms used are based on suffix tree and they are optimal. - Weighted Sequences indexing. In the next section, the study focuses on indexing of weighted sequences, and to answer questions like finding models, pairs, covers etc. in them. The weighted sequences are sequences …

    greece Repository record for Αποδοτική διαχείριση κειμενικής πληροφορίας: δεικτοδότηση, αποθήκευση, επεξεργασία και εφαρμογές (opens in a new tab)

  11. Sequence Mining Based Debugging of Wireless Sensor Networks

    … At first, I developed vectorized Probabilistic Suffix Tree (vPST), a variable memory length model to extract and store sequential information from program runtime traces in compact suffix tree based vectors, based on original Probabilistic Suffix Tree (PST). Then I built a novel WSN debugging …

    ut-knoxville Repository record for Sequence Mining Based Debugging of Wireless Sensor Networks (opens in a new tab)

  12. 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)

  13. 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)

  14. Direct suffix sorting and its applications

    The suffix sorting problem is to construct the suffix array for an input sequence. Given a sequence T[0... n -- 1] of size n = |T|, with symbols from a fixed alphabet Sigma, (|Sigma| ≤ n), the suffix array provides a compact representation of all the suffixes of T in a lexicographic order. …

    wvu Repository record for Direct suffix sorting and its applications (opens in a new tab)

  15. A general method for genome search and discovery.

    … study, we develop a new methodology based on the suffix tree data structure to identify unknown targets of gene families. We use the identification of hypoxia-inducible factor 1 (HIF-1) as a model system. HIF-1 is important in human normal physiological functions and in many human diseases such as …

    wvu Repository record for A general method for genome search and discovery. (opens in a new tab)

  16. Privacy-Preserving Genomic Data Publishing via Differential Privacy

    … data publishing via differentially-private suffix tree. The proposed algorithm uses a top-down approach and utilizes Laplace mechanism to divide the raw genomic data into disjoint partitions, and then normalize the partitioning structure to ensure consistency and maintain utility. The output …

    boise Repository record for Privacy-Preserving Genomic Data Publishing via Differential Privacy (opens in a new tab)

  17. Fast computation of supermaximal repeats in DNA sequences

    … the more versatile, but considerably larger suffix tree index STTD64. The results of our experiments using 24 homo sapiens chromosomes indicate that SMR significantly outperforms the Vmatch tool, the best known software package. Using constructed POL index, SMR is 2 times faster than Vmatch …

    concordia Download PDF for Fast computation of supermaximal repeats in DNA sequences (opens in a new tab)

  18. 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)

  19. 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)

  20. Parameterized Strings: Algorithms and Data Structures

    … only if prev(S) == prev(T). In order to utilize suffix data structures in terms of p-matching, we must account for the dynamic nature of the parameterized suffixes (p-suffixes) of T, namely prev(T[ i...n]) ∀ i, 1 ≤ i ≤ n.;In this work, we propose transformative approaches to the direct …

    wvu Repository record for Parameterized Strings: Algorithms and Data Structures (opens in a new tab)

Page 1 of 3