147 search results - page 2 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
TCS
2008
13 years 4 months ago
2008
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...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
IPL
2006
13 years 4 months ago
2006
BIOCOMP
2006
13 years 6 months ago
2006
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...