541 search results - page 7 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
SPIRE
2007
Springer
14 years 1 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
SIAMDM
1998
13 years 7 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...
ISAAC
2004
Springer
14 years 25 days ago
2004
Springer
DIS
2006
Springer
13 years 11 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...