147 search results - page 4 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
CSR
2006
Springer
13 years 9 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
JDA
2008
13 years 5 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
SPIRE
2010
Springer
13 years 4 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...
ISMIR
2004
Springer
13 years 11 months ago
2004
Springer
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...
IPL
2007
13 years 5 months ago
2007
