147 search results - page 4 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
99
Voted
CSR
2006
Springer
15 years 6 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...
116
Voted
JDA
2008
15 years 2 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, ...
150
Voted
SPIRE
2010
Springer
15 years 28 days 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...
104
click to vote
ISMIR
2004
Springer
15 years 8 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
15 years 2 months ago
2007
