147 search results - page 8 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
126
Voted
WG
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
107
click to vote
IPL
2008
15 years 2 months ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
147
click to vote
IEEESCC
2009
IEEE
15 years 9 days ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
132
Voted
SIAMDM
1998
15 years 2 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
113
Voted
SKG
2006
IEEE
15 years 8 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...