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 129 for “"Subsequences"”.
-
Subsequences and Supersequences of Strings
… In particular, we focus on problems involving subsequences and supersequences of strings.
-
Subsequences of frames and their operators
Dissertation supervisor: Dr. Peter G. Casazza.
-
LEVERAGING TEMPORAL SUBSEQUENCES FOR TIME-SERIES CLASSIFICATION
… short discriminative temporal patterns (subsequences) from the time-series for classification. These temporal subsequences, known as shapelets, are local patterns that can be used to uniquely identify the target class of a time-series instance. In this dissertation, I explore two …
-
Mining time-series data using discriminative subsequences
Time-series data is abundant, and must be analysed to extract usable knowledge. Local-shape-based methods offer improved performance for many problems, and a comprehensible method of understanding both data and models. For time-series classification, we transform the data into a local-shape space …
-
Random subsequences problems : asymptotics, variance, and quantum statistics.
… the length of the longest common and increasing subsequences. There we consider a totally ordered alphabet with an order, say 1,...,m, and the subsequences are simply made of a block of 1's, followed by a block of 2's, ... and so on (such a subsequence is increasing, but not strictly). Secondly, …
-
Topics on the longest common subsequences: Simulations, computations, and variance
The study of the longest common subsequences (LCSs) of two random words/strings is classical in computer science and bioinformatics. A problem of particular probabilistic interest is to determine the limiting behavior of the expectation and variance of the length of the LCSs, as the length of the …
-
State Complexity of Linear Relations and Linear Subsequences of Automatic Sequences
… 1$. We also study the state complexity of linear subsequences of automatic sequences; for example, we study the number of states required in the minimal automaton generating the linear subsequence $(h(i+c))_{i \geq 0}$ for some automatic sequences $(h(i))_{i \geq 0}$ and some constant integer $c …
-
Topics on the length of the longest common subsequences, with blocks, in binary random words
… of LIn, the length of the longest increasing subsequences, and of LCIn, the length of the longest common and increasing subsequences in random words is classical in computer science and bioinformatics, and has been well explored over the last few decades. This dissertation studies a …
-
Feature Identification and Reduction for Improved Generalization Accuracy in Secondary-Structure Prediction Using Temporal Context Inputs in Machine-Learning Models
… trivial, however, because identical amino-acid subsequences in different contexts sometimes have disparate secondary structures, while highly dissimilar amino-acid subsequences sometimes have identical secondary structures. We propose (1) to develop a set of metrics that facilitates better …
-
Techniques to explore time-related correlation in large datasets
… applications. Detecting similar sequences and subsequences within these databases is an important research area and has generated lot of interest recently. Previous studies in this area have concentrated on calculating similitude between (sub)sequences of equal sizes. The question of unequal …
-
A Dynamical Systems Approach to Estimating the Sequences of Repeat Regions in the Genome
… with the shotgun technique is the presence of subsequences longer than 500 letters that occur multiple times in the genome with minor variations. We present a dynamical systems approach to estimating the sequence of letters of these long, highly repetitive subsequences in the genome. Our …
-
Automated Software Debugging Using Hybrid Static/Dynamic Analysis
… then presented to the developers in the form of subsequences that may be causing the fault. The hypothesis is that code sequences that are shared between a number of faulty test cases for the same reason resemble the faulty execution path, and hence, the search space for the faulty execution path …
-
Checking sequences for distributed test architectures
… the construction of state and transition cover subsequences. A Rural Chinese Postman Path on the final digraph constructed by the method yields a synchronizable ordering of these subsequences. The second method does not require a reliable reset and constructs digraphs to generate subsequences …
-
Teaching sequences of behaviors to humans by forward chaining, backward chaining, and whole task training.
… the sequence by teaching increasingly longer subsequences until the entire sequence has been learned. In forward chaining, training involves gradually teaching the sequence from the beginning. Backward chaining involves gradually teaching the sequence from the end. Training is continued in …
-
Ideals of Linear Type and C -Sequences
… Raghavan about d-sequences), prove that initial subsequences of c-sequences are again c-sequences and deduce that every c-sequence is a sequence of linear type.
-
Multifractal analysis of DNA
… first technique breaks a DNA sequence into four subsequences based on the individual constituent bases, and treats each of these as strange attractors from which the multifractal dimension may be estimated. Results show that the generated subsequences exhibit multifractal properties which can be …
-
Topics in percolation and sequence analysis
… site percolation, and further to longest common subsequences in random words. In the second part, we prove that, in directed last passage site percolation over a $n\times\lfloor n^{\alpha}\rfloor$-grid and for i.i.d.~random weights having finite support, the order of the $r$-th central moment, …
-
Proposed FPGA-Based hardware architectures for acceleration of Smith-Waterman and K-Mers algorithms
… and K-Mers, a technique for counting subsequences fundamental in genomic analysis. We propose an innovative parallel hardware architecture for the SW algorithm, incorporating a systolic array structure that significantly accelerates the forward and backward phases of alignment. This …
-
Segmenting Genetic Sequences Based on Common Ancestry
… species and clusters them into groups of subsequences that are likely to be evolved from a single tree. Traditionally, the evolutionary history of a set of taxa is inferred with the assumption that the majority of genetic changes are passed on from ancestors to descendants. However, this …
-
Utilizing alignment-free methods to enable quantitative gene expression analysis of large collections of sequencing data
… Alignment-free methods are based on short subsequences of the actual sequence data. There are multiple different methods to determine these subsequences and this thesis provides a detailed analysis and comparison to determine the best method for such indices. Moreover, the benchmarking …
Page 1 of 7