• No results found

longest common subsequence algorithms

Fast Longest Common Subsequences for Bioinformatics Dynamic Programming

Fast Longest Common Subsequences for Bioinformatics Dynamic Programming

... Bioinformatics applications represent an increasingly important workload to improve the programs of sequence analysis. It can be used to assign function to genes and proteins by the study of the similarities between the ...

7

Facilitating Requirements Inspection with Search-Based Selection of Diverse Use Case Scenarios

Facilitating Requirements Inspection with Search-Based Selection of Diverse Use Case Scenarios

... Search algorithms with similarity functions have already been adopted to address optimization problems regarding test case selection or prioritization ...search algorithms to address the use case scenario ...

8

Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded

Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded

... In this paper, we make an effort to solve the LCS problem efficiently when one of the input strings is run length encoded. Our main contributions are two novel efficient algorithms, namely, LCS_RLE-I and LCS_RLE-II, ...

8

A Segment-Based Trajectory Similarity Measure in the Urban Transportation Systems

A Segment-Based Trajectory Similarity Measure in the Urban Transportation Systems

... [5], longest common subsequence algorithm (LCSS) [6], and edit distance on real sequence algorithm (EDR) ...Those algorithms can obtain the results of similarity measurement through computing ...

16

Using longest common subsequence and character models to predict word forms

Using longest common subsequence and character models to predict word forms

... Our system participated in SIGMORPHON- 2016 Shared Task on morphological inflection (Cotterell et al., 2016). This task required one to guess a single word form of a given category, not the whole paradigm, which is a ...

8

Mining Longest Common Subsequence and other Related Patterns using DNA Operations

Mining Longest Common Subsequence and other Related Patterns using DNA Operations

... of algorithms for different character ...a subsequence exactly, but rather something that is ...[3,4], Longest Common Subsequences [LCS] [23] ...the longest common pattern from ...

7

Longest Common Subsequence Problem for Run-Length-Encoded Strings

Longest Common Subsequence Problem for Run-Length-Encoded Strings

... Table II summarizes the time complexity of the relevant algorithms mentioned in Sub-Section I-A. It is evident from Table II that, only Sakai [8]’s algorithm is compara- ble to our algorithm. That algorithm has to ...

7

Robust Online Gesture Recognition with Crowdsourced Annotations

Robust Online Gesture Recognition with Crowdsourced Annotations

... for algorithms that can cope with the kinds of annotation errors that will anyway ...the longest common subsequence algorithm (known as LCSS or LCS in the literature) are suitable for online ...

34

On the Metaheuristics Approach to the Problem of Genetic Sequence Comparison and Its Parallel Implementation

On the Metaheuristics Approach to the Problem of Genetic Sequence Comparison and Its Parallel Implementation

... Results shown by parallel version of algorithm showed the same results, but shifted to a high values range. Pa- rallel implementation of fifth heuristics performed better than sequential one, and was closer to results ...

5

GRAPH PATTERN MATCHING IN YEAST DATASET

GRAPH PATTERN MATCHING IN YEAST DATASET

... This paper has presented an automatic Arabic- English cross-language plagiarism detection method. The proposed method consists of four phases: the first the pre-processing phase, the second phase is key phrase extraction ...

14

An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs

An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs

... In this paper, we present an efficient parallel algorithm for solving LCS problems on GPUs. By changing the data dependency in the score table used by dynamic program- ming, the algorithm enables higher degree of ...

6

An Optimized Parallel Algorithm for Longest Common Subsequence Using Openmp

An Optimized Parallel Algorithm for Longest Common Subsequence Using Openmp

... Positional_LCS algorithm using OpenMP constructs, as the Positional_LCS algorithm focuses only on the matched position it has less execution time as compared to other DP-LCS algorithms. We have also performed the ...

7

Trajectory Clustering Based on Trajectory Structure and Longest Common Subsequence

Trajectory Clustering Based on Trajectory Structure and Longest Common Subsequence

... clustering algorithms, like regression mixture model [2], partition-and-group framework and micro-and-macro cluster framework [3-5], while a number of improved algorithms have been proposed in ...The ...

5

An OpenMP based tool for finding longest common subsequence in bioinformatics

An OpenMP based tool for finding longest common subsequence in bioinformatics

... Out of the parallel solutions of the LCS problem, anti- diagonal [14] and bit-parallel [15] algorithms are few of the firsts and noteworthy attempts. Recently, with the rise of Graphics Processing Unit (GPU)-based ...

6

A Modified Weight Balanced Algorithm for Influential Users Community Detection in Online social Network (OSNs)

A Modified Weight Balanced Algorithm for Influential Users Community Detection in Online social Network (OSNs)

... Abstract—In the modern era online users are increasing day by day. Different users are using various social networks in different forms. The behavior and attitude of the users of social networking sites varies U2U (User ...

5

Building Monolingual Word Alignment Corpus for the Greater China Region

Building Monolingual Word Alignment Corpus for the Greater China Region

... the Longest Common Subsequence (Václáv and David, 1975) in parallel sentence pairs written in simplified script for Chi- nese Mainland and traditional script for Hong Kong and Taiwan, Line 5-7 refer ...

10

Expected length of longest common subsequences

Expected length of longest common subsequences

... In this section and Section 4.5 we shall work with the binary alphabet D = {0 , 1 }. Previous methods for an estimate o f F ( n , i ) counted the number o f all possible pairs that have a specific sequence as a ...

148

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

... 0 )+r ·S[i+L], i = 1, . . .,N−L. (7) Even though this expression uses vectors and is there- fore slightly more sophisticated than the most common expressions, CGR function is essentially a hash, except for the ...

12

A Relative Deviation Detection for Time Series Data Based on Equality

A Relative Deviation Detection for Time Series Data Based on Equality

... Obviously, we can’t get a certain answer on these definitions. Some additive definition should be given. This paper originates from this problem and aims to detect outlier patches in time series data. We show a neglected ...

6

A HYBRID GENETIC ALGORITHM FOR THE LONGEST COMMON SUB-SEQUENCE OF MULTIPLE SEQUENCES: A REVIEW

A HYBRID GENETIC ALGORITHM FOR THE LONGEST COMMON SUB-SEQUENCE OF MULTIPLE SEQUENCES: A REVIEW

... Ant Colony Optimization(ACO) algorithm for solving the k-LCS problem was proposed by Shyu and Tsai [21]. The main motive of the algorithm is to discover common characters that are at better positions in the ...

8

Show all 10000 documents...

Related subjects