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 12 of 12 for “"Substring"”.
-
Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction
… LCP array as a perfect tool to compute N-grams (substring) in various dimensions. Since past couple of decades there has been significant research on construction of suffix and LCP array. Comparatively the research of properly utilizing this prospective data structures to retrieve the substring …
-
A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem
… thesis revisits the k-mismatch shortest unique substring (SUS) finding problem and demonstrates that a technique recently presented in the context of solving the k-mismatch average common substring problem can be adapted and combined with parts of the existing solution, resulting in a new …
-
Quantum Algorithms For String Problems
… text processing problems: Longest Common Substring and Lexicographically Minimal String Rotation. Specifically, we show that: - Longest Common Substring can be solved by a quantum algorithm in Õ(n²⸍³) time, improving upon the Õ(n⁵⸍⁶)-time algorithm by Le Gall and Seddighin (2022). …
-
Approximate nearest neighbor problem in high dimensions
… neighbor when the data set points are the substrings of a given text T. The exact version of this problem is defined as follows. Given a text T of length n, we want to build a data structure that supports the following operation: given a pattern P, find the substring of T that is the …
-
Concept extraction for disability insurance payment evaluation
… Then, using a variation of the longest common substring algorithm, we characterize each medical file line using its substring overlaps with the list of medical concepts. Finally, with human annotations of whether each medical file line is relevant or not, we build machine learning classifiers …
-
Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering
… string s and a query mass M, whether s has a substring with mass M; to find where such a substring occurs; and other variants. We present an algorithm for binary alphabets which runs in time logarithmic in the length of s. Furthermore, we present several algorithms for the problem where …
-
Reading between the lines: psycholinguistic indices of prediction and formulaicity in language comprehension
… in cases where dimension such as whole-string or substring frequency are controlled for. Results from three experiments in this dissertation support a dual-route model of language processing, where the mode of processing that is employed is ultimately determined by context.
-
Scalable sketching and indexing algorithms for large biological datasets
… Firstly, we expand upon an existing k-mer (a substring of length k) -based approach, a universal hitting set (UHS), to sample a subset of locations on a DNA sequence. We show that UHSs can be efficiently constructed using a randomized parallel algorithm, and propose ways in which UHSs can be …
-
Audio-visual football video analysis, from structure detection to attention analysis
… tree is proposed to find the longest repetitive substring in the label sequence of shot class transitions. These occurrences of this substring are regarded as a kernel of an attack hidden Markov process. Therefore, the decomposition of attack structure becomes a boundary likelihood comparison …
-
Constant composition deletion correcting codes
… on code size, and describe constructions. The substring partial order has a suprising property: for any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account: for any string, the …
-
Omnisculptures.
… <em>k</em> over [<em>A</em>]={1,2,...a} as a substring. An omnimosaic <em>O</em>(<em>n</em>,<em>k</em>,<em>a</em>) is an <em>n</em> × <em>n</em> matrix, with entries from the set <em>A</em> ={1,2,...,<em>a</em>}, that contains each of the {<em>a<sup>k<sup>2</sup></sup></em>} <em>k</em> × …
-
Searching over encrypted data
… expressive by enabling Boolean, semantic, and substring queries. Practitioners, however, need to be very careful about the provided balance between the security leakage and the degree of desired expressiveness. Second, we improve ORAM's bandwidth by introducing a novel recursive data structure …