541 search results - page 8 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
CJ
2008
13 years 8 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
DIS
2000
Springer
14 years 27 days ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
SPIRE
2001
Springer
14 years 1 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
CSR
2006
Springer
14 years 7 days ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...