Sciweavers

BIOCOMP
2006
13 years 6 months ago
Parameterized Computation of LCS for Two Sequences
- 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...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
IJCAI
2007
13 years 6 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
ICPR
2010
IEEE
13 years 8 months ago
Normalized Sum-Over-Paths Edit Distances
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
Silvia García, François Fouss, Masashi Shimbo, M...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 8 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
13 years 8 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
13 years 8 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
SPIRE
2001
Springer
13 years 9 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
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...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...
DEXAW
2002
IEEE
101views Database» more  DEXAW 2002»
13 years 9 months ago
Robust Similarity Measures for Mobile Object Trajectories
We investigate techniques for similarity analysis of spatio-temporal trajectories for mobile objects. Such kind of data may contain a great amount of outliers, which degrades the ...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
ISMIR
2004
Springer
163views Music» more  ISMIR 2004»
13 years 10 months ago
Time-Warped Longest Common Subsequence Algorithm for Music Retrieval
Recent advances in music information retrieval have enabled users to query a database by singing or humming into a microphone. The queries are often inaccurate versions of the ori...
AnYuan Guo, Hava T. Siegelmann
FCT
2005
Springer
13 years 10 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...