16 search results - page 2 / 4 » Parameterized Computation of LCS for Two Sequences |
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2 m lg m) time algorithm is presented for computing the maximum ...
SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...
WG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...