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 179 for “"Subsequence"”.
-
Combinatorial Optimization of Subsequence Patterns in Words
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation …
-
Analysis of the subsequence composition of biosequences
… measures based on the repertoire of distinct subsequences of any length, but constrained to occur with a predefined maximum gap between consecutive symbols. Such measures highlight previously unknown laws that relate subsequence abundance to string length and to the allowed gap, across a range …
-
The Longest Common Subsequence via Generalized Suffix Trees
… strings S1 and S 2, finding the longest common subsequence (LCS) is a classical problem in computer science. Many algorithms have been proposed to find the longest common subsequence between two strings. The most common and widely used method is the dynamic programming approach, which runs in …
-
A fast multiple longest common subsequence (MLCS) algorithm
… AT AUTHOR'S REQUEST.] Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many applications in the areas of bioinformatics and computational genomics. Although significant efforts have been made to address the problem and its special cases, the increasing …
-
OPTIMAL SUBSEQUENCE BIJECTION AND CLASSIFICATION OF IMBALANCED DATA SETS
… using an algorithm that determines the optimal subsequence bijection (OSB) of a query and target time series. The OSB is efficiently computed since the problem’s solution is mapped to a cheapest path in a DAG (directed acyclic graph). We make several significant improvements to the original OSB …
-
Aspects of random matrix theory: concentration and subsequence problems
… focuses on relations between limiting law in subsequence problems and spectra of random matrices.
-
Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System
… performance of parallel algorithms related to subsequence problems. The problems include string to string correction problem, to determine the longest common subsequence problem and solving the sum-range-product, 1 —D pattern matching, longest non-decreasing (non-increasing) (LNS) and maximum …
-
Analysis and performance of a UPC implementation of a parallel longest common subsequence algorithm
… biology is finding the longest common subsequence (LCS) of two nucleotide sequences. This paper examines the correctness and performance of a recently proposed parallel LCS algorithm that uses successor tables and pruning rules to construct a list of sets from which an LCS can be easily …
-
The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
… increasing and adjacent consecutive increasing subsequences in sequences. Fu and Hsieh (2015) obtained the exact distribution of the length of the longest increasing subsequence in random permutations. To the best of our knowledge, little or no work has been done on the exact distribution of the …
-
Efficient and effective query processing of complex human motion sequences
… matching of human motion sequences, efficient subsequence matching, and subsequence join of human motion sequences. Our solutions on subsequence matching and subsequence join techniques over human motion sequences can be applied to managing a large set of human motion sequences.
-
Topics in Combinatorics and Random Matrix Theory
Motivated by the longest increasing subsequence problem, we examine sundry topics at the interface of enumerative/algebraic combinatorics and random matrix theory. We begin with an expository account of the increasing subsequence problem, contextualizing it as an ``exactly solvable'' Ramsey-type …
-
THE RELATIONSHIP BETWEEN AMBULATORY CARE LAPSES AND MEDICAL UTILIZATION IN DIABETIC PATIENTS
… care for diabetic patients influences the subsequence medical utilization. Therefore, the objective of this study was to clarify whether different duration of ambulatory care lapses were associated with the stroke utilization in diabetic patients with subsequence ischemic stroke. We …
-
Determinacy-related Consequences on Limit Superiors
… Polish space, if the limit superior along every subsequence was uncountable, then there was a particular subsequence whose intersection actually contained a perfect subset. Komjath later expanded the result to hold for analytic sets. In this paper, by adding AD and sometimes V=L(R) to our …
-
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 …
-
Evaluating distance measures for trajectories in the mobile setting
… Dynamic Time Warping (DTW), του Longest Common Subsequence (LCSS), και της Frechet Distance. Δεδομένης της αξιολόγησης, ο Dynamic TIme Warping (DTW) είναι αντίστοιχος της απόστασης L2, καθώς λαμβάνει υπόψιν του τις ατομικές διαφορές όλων των σημείων μεταξύ δύο τροχιών. Ομοίως, ο Longest Common …
-
Sequence queries on temporal graphs
… into two parts: graph node similarity and subsequence matching. For node similarity, this thesis proposes a modified tree edit distance that is metric and polynomially computable and has a natural, intuitive interpretation. Note that the proposed node similarity works even for inter-graph …
-
Constructions & Optimization in Classical Real Analysis Theorems
… will be interested in constructing a convergent subsequence from a non-convergent bounded sequence. Such a subsequence is guaranteed to exist, but it is often not obvious what it is, e.g., if an = sin n. Next, the H¨older Inequality gives an upper bound, in terms of p ∈ [1,∞], for the the …
Page 1 of 9