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 7 of 7 for “"full-text index"”.

  1. Indexing Compressed Text

    … rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we …

    waterloo Repository record for Indexing Compressed Text (opens in a new tab)

  2. Optimizing relational search with embedded neural network

    … of fuzzy string matching using traditional full-text index structures. We propose a solution to overcome the bottleneck by incorporating horizontally partitioned full-text indexes and an embeddable neural network classifier in the query processing pipeline. The classifier is trained with …

    uoit Repository record for Optimizing relational search with embedded neural network (opens in a new tab)

  3. Reverb: dynamic bookmarks for developers

    … and methods referenced in the local code context and running these queries against a full-text index of the developer’s browsing history, as collected from popular browsers used. We describe Reverb’s implementation and present results from a study in which developers used Reverb while working …

    ubc Repository record for Reverb: dynamic bookmarks for developers (opens in a new tab) Download PDF for Reverb: dynamic bookmarks for developers (opens in a new tab)

  4. Indices and Applications in High-Throughput Sequencing

    … One such data structures is the substring index, that represents all substrings or substrings up to a certain length contained in a given text. In this thesis we propose 3 substring indices, which we extend to be applicable to millions of sequences. We devise internal and external memory …

    fu-berlin Repository record for Indices and Applications in High-Throughput Sequencing (opens in a new tab)

  5. Developing compressed linear pangenome indexes for rapid sequence classification

    … databases using a compressed linear pangenome index. The first half of the thesis will present novel computational methods for quickly classifying whether a sequencing read appears to have originated from a pangenome reference. We present an efficient string matching algorithm computing a …

    jhu Repository record for Developing compressed linear pangenome indexes for rapid sequence classification (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. Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index

    … string matching using bidirectional FM-index, and utilize them in increasing the speed of such searches. Such a problem arises in computer science with many applications. Approximate string matching problem is also central in bioinformatics where biologists are interested in aligning …

    tamu Repository record for Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index (opens in a new tab)