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 39 for “"Longest common subsequence"”.

  1. The Longest Common Subsequence via Generalized Suffix Trees

    Given two 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 …

    wvu Repository record for The Longest Common Subsequence via Generalized Suffix Trees (opens in a new tab)

  2. A fast multiple longest common subsequence (MLCS) algorithm

    … OF MISSOURI 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, …

    missouri Repository record for A fast multiple longest common subsequence (MLCS) algorithm (opens in a new tab)

  3. Analysis and performance of a UPC implementation of a parallel longest common subsequence algorithm

    … problem in computational 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 …

    mtu Repository record for Analysis and performance of a UPC implementation of a parallel longest common subsequence algorithm (opens in a new tab)

  4. Evaluating distance measures for trajectories in the mobile setting

    … ομοιότητας, του Dynamic Time Warping (DTW), του Longest Common Subsequence (LCSS), και της Frechet Distance. Δεδομένης της αξιολόγησης, ο Dynamic TIme Warping (DTW) είναι αντίστοιχος της απόστασης L2, καθώς λαμβάνει υπόψιν του τις ατομικές διαφορές όλων των σημείων μεταξύ δύο τροχιών. Ομοίως, ο …

    athens Repository record for Evaluating distance measures for trajectories in the mobile setting (opens in a new tab)

  5. Algorithms and complexity for annotated sequence analysis

    … such as sequence alignment or finding the longest common subsequence can make the problem more complex, often depending on the complexity of the annotation scheme. This research examines the different annotation schemes and the corresponding problems of verifying annotations, creating …

    uvic Repository record for Algorithms and complexity for annotated sequence analysis (opens in a new tab)

  6. Memory-Restricted and Secure Algorithms For Large Datasets

    … as maximum matching, sorting, edit distance and longest common subsequence in massive datasets. We consider two popular models to deal with massive inputs. The first model is the streaming model in which the input is represented as a sequence of items and the algorithm has limited space and is …

    maryland Repository record for Memory-Restricted and Secure Algorithms For Large Datasets (opens in a new tab)

  7. Topics in sequence analysis

    … row of the Young diagrams is the length of the longest (weakly) increasing subsequence of the random word, the corresponding large deviations follow. When the letters are drawn with non-uniform probability, a control of both highest probabilities will ensure that the length of the top row of the …

    gatech Repository record for Topics in sequence analysis (opens in a new tab)

  8. 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 …

    unt Repository record for Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System (opens in a new tab)

  9. Identifying similar code fragments in Haskell

    … algorithm (The Hungarian method) and the longest common subsequence algorithm. Munkres assignment algorithm helps to identify rearranged code fragments. The LCS algorithm is used to compare subtrees of different syntactic variants. Experiments showed that these algorithms can help better …

    uiuc Repository record for Identifying similar code fragments in Haskell (opens in a new tab)

  10. Transit Bus Number Identification for Frictionless Fare Collection Using Passenger Location Data

    … using Dynamic Time Warping (DTW) and Longest Common Subsequence (LCSS) algorithms. By matching user trajectories with GTFS data, the system accurately identifies the bus services used, enabling frictionless fare calculation and integration of payment systems. Our results show that DTW …

    mcmaster Repository record for Transit Bus Number Identification for Frictionless Fare Collection Using Passenger Location Data (opens in a new tab)

  11. Measuring the accuracy of page-reading systems

    … classes, and the cost functions related to the longest common subsequence (LCS) are identified. The computation of a LCS can be made faster by a linear-time preprocessing step.

    unlv Repository record for Measuring the accuracy of page-reading systems (opens in a new tab) Download PDF for Measuring the accuracy of page-reading systems (opens in a new tab)

  12. Sekoskaitos fragmentų sulyginimo su referentiniu genomu algoritmų tyrimas /

    … of seeds are selected for further evaluation. Longest common subsequence is used as a similarity metric to choose the candidate with the minimum number of mismatches with the original read. I compared the proposed algorithm with popular short read aligners in terms of speed, sensitivity, and …

    vilnius Repository record for Sekoskaitos fragmentų sulyginimo su referentiniu genomu algoritmų tyrimas / (opens in a new tab)

  13. Optimal payoff to ensure opacity in Discrete-Event Systems

    … approach, which relies on the solution to the longest common subsequence problem. This approach can lower the complexity of the solution at least for some cases (namely, systems with no loops). Secondly, we propose to add utilities for revealing transitions and provide algorithms that enforce …

    queens Repository record for Optimal payoff to ensure opacity in Discrete-Event Systems (opens in a new tab)

  14. Clustering, weighted sequences, and shortest paths

    … Paths in Planar Digraphs" appeared in SOSA '22.Longest Common Subsequence on Weighted Sequences: Weighted sequences generalize the concept of strings, so that in each position we have a probability distribution over the alphabet, rather than a single character. The motivation comes from the …

    greece Repository record for Clustering, weighted sequences, and shortest paths (opens in a new tab)

  15. Applications of corpus-based semantic similarity and word segmentation to database schema matching

    … target words and distinguish the words which are common in both lists and aggregate their PMI values (from the opposite list) to calculate the relative similarity score. Our word segmentation method uses corpus type frequency information to choose the type with maximum length and frequency from …

    ottawa-retro Repository record for Applications of corpus-based semantic similarity and word segmentation to database schema matching (opens in a new tab)

  16. SCANNER: Sequence Clustering of resource Access to find Nearest Neighbors

    … behaving applications. We propose to use the Longest Common Subsequence (LCS) to describe the ordered sequences and contrast it with the use of statistical access rates for characterizing application behaviors. Using these features, the applications are clustered to find the nearest neighbors. …

    rit Repository record for SCANNER: Sequence Clustering of resource Access to find Nearest Neighbors (opens in a new tab)

  17. Matching Traffic Objects recorded by Stereoscopic Cameras

    … the use of Expectation maximization (EM). Once a common coordinate system has been found, one still needs to merge the trajectories from the different cameras corresponding to the same traffic object into a single trajectory. Preferably, this too should be done using only the information recorded …

    chalmers Repository record for Matching Traffic Objects recorded by Stereoscopic Cameras (opens in a new tab)

  18. The Binary String-to-String Correction Problem

    … swap in one direction; that the length of the Longest Common Subsequence (LCS) of the two strings is monotone nondecreasing during the execution of an optimal solution; and that there exists no correlation between the effect of a swap or delete operation on LCS, and the optimality of that …

    uvic Repository record for The Binary String-to-String Correction Problem (opens in a new tab)

  19. CHAracterization of Relevant Attributes using Cyber Trajectory Similarities

    … contribution of this work is to use a revised Longest Common Subsequence(LCS) algorithm to analyze attack tracks as trajectories. This allows a systematic analysis to determine which alert attributes within a track are of great value to the characterization of multi-stage attacks. The basic LCS …

    rit Repository record for CHAracterization of Relevant Attributes using Cyber Trajectory Similarities (opens in a new tab)

  20. An integrated complexity analysis of problems from computational biology

    … INTERVALIZING COLORED GRAPHS and SHORTEST COMMON SUPERSEQUENCE. The fundamental concern of parameterized complexity is the apparent qualitative difference in algorithmic behaviour displayed by many problems when one or more input parameters are bounded. For many problems, only a small range …

    uvic Repository record for An integrated complexity analysis of problems from computational biology (opens in a new tab)

Page 1 of 2