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

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

  2. The -ing suffix in French

    … number of words that contain the English -ing suffix. This phenomenon stands in contrast to the stereotype of the French being purists with regards to language choice and use. Indeed, there is a variety of evidence that this suffix has been integrated into French as a productive derivational …

    nodak Repository record for The -ing suffix in French (opens in a new tab)

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

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

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

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

  7. The attributive suffix in Pastaza Kichwa

    … is a corpus-based description of the attributive suffix -k in Pastaza Kichwa, a Quechuan language spoken in lowland Amazonian Ecuador. The goal of this work is, first, to describe the behaviors, characteristics, and functions of the suffix using data from the Corpus of Pastaza Kichwa (Rice 2018a), …

    byu Repository record for The attributive suffix in Pastaza Kichwa (opens in a new tab) Download PDF for The attributive suffix in Pastaza Kichwa (opens in a new tab)

  8. The Korean I-suffix: A functional approach

    … treats a problem presented by Korean syntax. The suffix $\{-i\},$ realized variously as -i, -hi, -li, -ki, may be used to express (among others) prototypical passives, middle voice, and causatives. I attempt to provide an answer to the question "How are these uses related?' The semantic/conceptual …

    rice Repository record for The Korean I-suffix: A functional approach (opens in a new tab)

  9. The ezafat suffix: The syntax-semantics interface

    Any discussion of Dari noun phrases pays special attention to Ezafat and the way it behaves. Ezafat is of great importance to understanding the underlying structure of a Dari noun phrase. Much of this thesis uses the methodologies and tools provided by generative syntax to determine the status of …

    emich Repository record for The ezafat suffix: The syntax-semantics interface (opens in a new tab)

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

  11. String matching and indexing with suffix data structures

    This thesis studies methods for indexing a text so that the occurrences of any given query string in the text can be located efficiently. An occurrence or match may be imprecise, allowing some deviations from the actual query. This gives rise to a family of interesting string matching problems like …

    nus Repository record for String matching and indexing with suffix data structures (opens in a new tab) Download file for String matching and indexing with suffix data structures (opens in a new tab)

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

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

  14. Dao as a verbal suffix in Chinese verbs

    … focuses on the resultative ending dao as a suffix to Chinese verbs. Although dao is commonly understood as a mono-morphemic verb, a preposition or a verbal complement, little attention has been given to its function as a verbal suffix. This study attempts to highlight the inflectional nature …

    uiuc Repository record for Dao as a verbal suffix in Chinese verbs (opens in a new tab)

  15. USING SUFFIX ARRAYS FOR LEMPEL-ZIV DATA COMPRESSION

    … the use of sophisticated data structures (e.g. suffix trees, binary search trees, etc) to hold the dictionary in order to boost the search time. The problem with such data structures is that the amount of memory required is variable and cannot be known in advance. Furthermore, some of these data …

    mcmaster Repository record for USING SUFFIX ARRAYS FOR LEMPEL-ZIV DATA COMPRESSION (opens in a new tab)

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

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

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

  19. Control and organization in primary memory: Evidence from suffix effects

    … of such control and organization for the suffix effect. The suffix effect arises when a nominally irrelevant speech item, or "suffix," is appended to a spoken sequence of items, and it consists of an impairment in the recall of the most recent items in the sequence, especially the last …

    rice Repository record for Control and organization in primary memory: Evidence from suffix effects (opens in a new tab)

Page 1 of 20