Sciweavers

32 search results - page 3 / 7
» Semi-local longest common subsequences in subquadratic time
Sort
View
TCS
2008
13 years 7 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
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 1 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
IJCAI
2007
13 years 8 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
13 years 12 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
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...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
SPIRE
2007
Springer
14 years 1 months ago
Generalized LCS
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva ...