Sciweavers

32 search results - page 2 / 7
» Semi-local longest common subsequences in subquadratic time
Sort
View
IPPS
2003
IEEE
13 years 11 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
FCS
2006
13 years 7 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
13 years 9 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
COCOON
2005
Springer
13 years 11 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
PDP
2003
IEEE
13 years 11 months ago
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
Thierry Garcia, Jean Frédéric Myoupo...