A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A New Efficient Algorithm for Computing the Longest Common Subsequence

2008
*
Theory of Computing Systems
*

*The*

*longest*

*common*

*subsequence*(LCS) problem is

*a*classic and well-studied problem in

*computer*science. ... In this paper, we present

*a*

*new*and

*efficient*

*algorithm*

*for*solving

*the*LCS problem

*for*two strings. ...

*The*

*longest*

*common*

*subsequence*problem

*for*two strings, is to find

*a*

*common*

*subsequence*in both strings, having maximum possible length. ...

##
###
A New Efficient Algorithm for Computing the Longest Common Subsequence
[chapter]

*
Algorithmic Aspects in Information and Management
*

*The*

*longest*

*common*

*subsequence*(LCS) problem is

*a*classic and well-studied problem in

*computer*science. ... In this paper, we present

*a*

*new*and

*efficient*

*algorithm*

*for*solving

*the*LCS problem

*for*two strings. ...

*The*

*longest*

*common*

*subsequence*problem

*for*two strings, is to find

*a*

*common*

*subsequence*in both strings, having maximum possible length. ...

##
###
Page 63 of Journal of Research and Practice in Information Technology Vol. 11, Issue 2
[page]

1979
*
Journal of Research and Practice in Information Technology
*

*A*Fast

*Algorithm*

*for*Text Comparison R. Geoff Dromey* Two

*new*

*algorithms*

*for*finding

*the*

*longest*unbroken

*common*

*subsequence*in

*a*pair of text files are presented. ... CR Categories: 3.53, 3.71, 3.74, 4.22, 5.25. i INTRODUCTION

*A*number of

*algorithms*have been proposed

*for*finding

*the*

*longest*

*common*

*subsequence*of two strings

*A*and B. ...

##
###
A New Algorithm for the Longest Common Subsequence Problem

2007
*
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)
*

In this paper,

doi:10.1109/cisw.2007.4425458
fatcat:6k4dwunupjfqhictcf6d7euz7y
*a*robust*algorithm*is presented*for*finding similarity between two time series.*The**longest**common**subsequence*(LCSS) is calculated by avoiding unnecessary comparisons. ...*A*special feature of LCSS called special*longest**common**subsequence*(SLCSS) is also presented. ... Gateway is directly connected to*a**computer*on*Subsequence*: Proposed*Algorithm**for*LCSS: Consider two time series*Longest**common**subsequence*[17] is defined as*the*S = s , s , …, s and T = t , t ,…, ...##
###
Fast evaluation of sequence pair in block placement by longest common subsequence computation

2001
*
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
*

This paper presents

doi:10.1109/43.969434
fatcat:ylzhnwwngbgvtj7qp7oe6kisca
*a**new*approach to evaluate*a*sequence pair based on*computing**longest**common**subsequence*in*a*pair of weighted sequences. ... We present*a*very simple and*efficient*Ç´Ò ¾ µ*algorithm*to solve*the*sequence pair evaluation problem. ... In this paper, we present*a**new*approach to evaluate*a*sequence pair based on*computing**longest**common**subsequence*in*a*pair of weighted sequences. ...##
###
Fast evaluation of sequence pair in block placement by longest common subsequence computation

2000
*
Proceedings of the conference on Design, automation and test in Europe - DATE '00
*

This paper presents

doi:10.1145/343647.343713
fatcat:c536v7jkd5d6fnbvlznxtnjjxu
*a**new*approach to evaluate*a*sequence pair based on*computing**longest**common**subsequence*in*a*pair of weighted sequences. ... We present*a*very simple and*efficient*Ç´Ò ¾ µ*algorithm*to solve*the*sequence pair evaluation problem. ... In this paper, we present*a**new*approach to evaluate*a*sequence pair based on*computing**longest**common**subsequence*in*a*pair of weighted sequences. ...##
###
A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint

2013
*
Algorithms
*

*For*

*the*two input sequences, X and Y , of lengths n and m and

*a*constraint string, P , of length r,

*the*goal is to find

*the*

*longest*

*common*

*subsequence*, Z, of X and Y that excludes P as

*a*substring. ... This paper studies

*the*string-excluding (STR-EC)-constrained

*longest*

*common*

*subsequence*(LCS) problem,

*a*generalized LCS problem. ... Acknowledgments

*The*authors acknowledge

*the*financial support of

*the*Natural Science

*The*authors are grateful to

*the*anonymous referee

*for*

*a*careful checking of

*the*details and

*for*helpful comments that ...

##
###
Computing the Number of Longest Common Subsequences
[article]

2003
*
arXiv
*
pre-print

This note provides very simple,

arXiv:cs/0301034v1
fatcat:fz5pkgobqrbn5hens5zt4owv6a
*efficient**algorithms**for**computing**the*number of distinct*longest**common**subsequences*of two input strings and*for**computing**the*number of LCS embeddings. ...*A**common**subsequence*of*A*and B is*a**subsequence*of both*A*and B.*A**longest**common**subsequence*(LCS) is*a**common**subsequence*of greatest possible length. ...*a*similar approach to devise an O(mn)*algorithm*to*compute**the*number of distinct LCSs D[m, n] of*a*1*a*2 . . .*a*m and b 1 b 2 . . . b n : 1*for*j ← 0 to n do 2*for*i ← 0 to m do 3 if i = 0 or j = 0 then ...##
###
A Dynamic Programming Solution to a Generalized LCS Problem
[article]

2013
*
arXiv
*
pre-print

In this paper, we consider

arXiv:1301.7183v1
fatcat:a2mkkra5rfghlk3cjcr35kzzxe
*a*generalized*longest**common**subsequence*problem,*the*string-excluding constrained LCS problem. ...*A**new*dynamic programming solution*for**the*STR-EC-LCS problem is then presented in this paper.*The*correctness of*the**new**algorithm*is proved.*The*time complexity of*the**new**algorithm*is O(nmr). ...*The**longest**common**subsequence*(LCS) problem is*a*well-known measurement*for**computing**the*similarity of two strings. ...##
###
A New DNA sequencing alignment methodology using the Longest Common Subsequence technique

2020
*
American Journal of Applied Mathematics and Computing
*

*The*goal of this paper is to perform DNA sequence alignment using

*the*

*Longest*

*Common*

*Subsequence*

*Algorithm*to obtain

*the*

*longest*

*common*

*subsequence*from

*the*two strings X and Y

*for*matching DNA in molecular ...

*The*paper will be implemented in terms of space and time using

*the*optimized

*longest*

*common*

*subsequence*

*algorithm*. ... In

*the*below graph we display

*a*graph showing our proposed

*new*DNA sequencing alignment method using

*the*

*longest*

*common*

*subsequence*utilizing dynamic programming strategy. VI. ...

##
###
Page 6236 of Mathematical Reviews Vol. , Issue 96j
[page]

1996
*
Mathematical Reviews
*

*A*

*new*

*algorithm*that is

*efficient*

*for*both short and long

*longest*

*common*

*subsequences*is presented. It also improves on previ- ous methods

*for*

*longest*

*common*

*subsequences*of intermediate length. ... ., 900, Springer, Berlin, 1995] to two-dimensional patterns.” 96j:68081 68Q20 68R15 92D20 Rick, Claus (D-BONN-I4; Bonn)

*A*

*new*flexible

*algorithm*

*for*

*the*

*longest*

*common*

*subsequence*problem. ...

##
###
A simple linear space algorithm for computing a longest common increasing subsequence
[article]

2016
*
arXiv
*
pre-print

An extremely simple linear space

arXiv:1608.07002v1
fatcat:goaeng47tzcdpnvwe2osbkyaya
*algorithm*based on*the**new*formula can find*a**longest**common*increasing*subsequence*of sizes n and m respectively, in time O(nm) using additional {n,m}+1 space. ... This paper reformulates*the*problem of finding*a**longest**common*increasing*subsequence*of*the*two given input sequences in*a*very succinct way. ... An extremely simple linear space*algorithm*based on*the**new*formula can find*a**longest**common*increasing*subsequence*of X and Y in time O(nm) using additional min{n, m} + 1 space. ...##
###
An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
[article]

2013
*
arXiv
*
pre-print

In this paper, we consider

arXiv:1303.1872v1
fatcat:uv2t66kfajcfzjovi5iibihqni
*a*generalized*longest**common**subsequence*problem with multiple substring exclusion constrains. ...*The*correctness of*the**new**algorithm*is proved.*The*time complexity of our*algorithm*is O(nmr). ...*The**longest**common**subsequence*(LCS) problem is*a*well-known measurement*for**computing**the*similarity of two strings. ...##
###
Fast Longest Common Subsequences for Bioinformatics Dynamic Programming

2012
*
International Journal of Computer Applications
*

This paper introduces

doi:10.5120/9419-3569
fatcat:fmoathbdkbcljmv74rdojer6r4
*a*modified implementation of bioinformatics*algorithm**for*sequence alignment .*The*implemented*algorithm*is called Fast*Longest**Common**Subsequence*(FLCS). ... To illustrate*the*effectiveness of optimizing*the*performance of*the*proposed FLCS*algorithm*and demonstrate its superiority, it is compared with Needleman-Wunsch, Smith-Waterman and*Longest**Common**Subsequence*... CONCLUCION In this paper,*a*modification to*the*implementation of*Longest**Common**Subsequence**algorithm*called Fast*Longest**Common**Subsequences*(FLCS) is made. ...##
###
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
[article]

2015
*
arXiv
*
pre-print

In

arXiv:1505.06529v1
fatcat:elkfjilgtbcznfdug4lttblxba
*the*case of*the*number of constraint strings is fixed, our*new**algorithm**for**the*generalized*longest**common**subsequence*problem with multiple substring inclusive constraints requires O(nmr) time and ... In this paper, we consider*a*generalized*longest**common**subsequence*problem with multiple substring inclusive constraints. ... Concluding Remarks We have suggested*a**new*dynamic programming solution*for**the**new*generalized constrained*longest**common**subsequence*problem M-STR-IC-LCS. ...
« Previous

*Showing results 1 — 15 out of 47,587 results*