Sciweavers

1421 search results - page 13 / 285
» Algorithms for subsequence combinatorics
Sort
View
140
Voted
PDP
2003
IEEE
15 years 9 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...
144
Voted
FOCS
2007
IEEE
15 years 10 months ago
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
Anna Gál, Parikshit Gopalan
125
Voted
TCS
2008
15 years 3 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
115
Voted
EUROPAR
2006
Springer
15 years 7 months ago
A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers
Carlos E. R. Alves, Edson Norberto Cáceres,...
95
Voted
BIOCOMP
2008
15 years 5 months ago
An Efficient Algorithm for the Longest Pattern Subsequence Problem
Xiaodong Wang, Lei Wang, Yingjie Wu