16 search results - page 1 / 4 » Longest Common Separable Pattern Among Permutations |
CPM
2007
Springer
14 years 5 months ago
2007
Springer
CORR
2007
Springer
13 years 10 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
SKG
2006
IEEE
14 years 4 months ago
2006
IEEE
The paper presents a Grid Service allowing to detect and extract the longest common sub-spectrum among a set of mass spectrometry spectra data. The service is based on a novel pat...
ISCIS
2003
Springer
14 years 4 months ago
2003
Springer
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applications. This kernel is an irregular problem, which has led to the development of...