2 search results - page 1 / 1 » Faster subsequence recognition in compressed strings |
86
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
115
Voted
SIAMDM
1998
15 years 11 days 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...