-
2
-
-
0022663527
-
The boyer-moore-galil string searching strategies revisited
-
A. Apostolico and R. Giancarlo. The boyer-moore-galil string searching strategies revisited. SIAM J. Comput., 15(1):98-105, 1986.
-
(1986)
SIAM J. Comput.
, vol.15
, Issue.1
, pp. 98-105
-
-
Apostolico, A.1
Giancarlo, R.2
-
4
-
-
0017547820
-
A fast string searching algorithm
-
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
-
(1977)
Commun. ACM
, vol.20
, Issue.10
, pp. 762-772
-
-
Boyer, R.S.1
Moore, J.S.2
-
5
-
-
0033609581
-
Fast practical multi-pattern matching
-
M. Crochemore, A. Czumaj, L. Gasieniec, T. Lecroq, W. Plandowski, and W. Rytter. Fast practical multi-pattern matching. Inf. Process. Lett., 71(3-4):107-113, 1999.
-
(1999)
Inf. Process. Lett.
, vol.71
, Issue.3-4
, pp. 107-113
-
-
Crochemore, M.1
Czumaj, A.2
Gasieniec, L.3
Lecroq, T.4
Plandowski, W.5
Rytter, W.6
-
9
-
-
33745784530
-
Mining Web sequential patterns incrementally with revised PLWAP tree
-
C. I. Ezeife and M. Chen. Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree. In WAIM, pages 539-548, 2004.
-
(2004)
WAIM
, pp. 539-548
-
-
Ezeife, C.I.1
Chen, M.2
-
11
-
-
0036040646
-
Shape-based retrieval of similar subsequences in time-series databases
-
S.-W. Kim, J. Yoon, S. Park, and T.-H. Kim. Shape-based Retrieval of Similar Subsequences In Time-Series Databases. In Proc. ACM Symposium on Applied Computing, pages 438-445, 2002.
-
(2002)
Proc. ACM Symposium on Applied Computing
, pp. 438-445
-
-
Kim, S.-W.1
Yoon, J.2
Park, S.3
Kim, T.-H.4
-
12
-
-
0000904908
-
Fast pattern matching in strings
-
D. Knuth, J. Morris, and V. Pratt. Fast Pattern Matching in Strings. SIAM J. Computing, 6(2):323-350, 1977.
-
(1977)
SIAM J. Computing
, vol.6
, Issue.2
, pp. 323-350
-
-
Knuth, D.1
Morris, J.2
Pratt, V.3
-
13
-
-
0002193989
-
Fast string matching with k differences
-
G. M. Landau and U. Vishkin. Fast string matching with k differences. J. Comput. Syst. Sci., 37(1):63-78, 1988.
-
(1988)
J. Comput. Syst. Sci.
, vol.37
, Issue.1
, pp. 63-78
-
-
Landau, G.M.1
Vishkin, U.2
-
16
-
-
12244264433
-
Mining, indexing, and querying historical spatiotemporal data
-
N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. Mining, indexing, and querying historical spatiotemporal data. In ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'04), pages 236-245, 2004.
-
(2004)
ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04)
, pp. 236-245
-
-
Mamoulis, N.1
Cao, H.2
Kollios, G.3
Hadjieleftheriou, M.4
Tao, Y.5
Cheung, D.W.6
-
18
-
-
0031632094
-
Srql: Sorted relational query language
-
IEEE Computer Society
-
R. Ramakrishnan, D. Donjerkovic, A. Ranganathan, K. S. Beyer, and M. Krishnaprasad. Srql: Sorted relational query language. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), pages 84-95. IEEE Computer Society, 1998.
-
(1998)
Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM)
, pp. 84-95
-
-
Ramakrishnan, R.1
Donjerkovic, D.2
Ranganathan, A.3
Beyer, K.S.4
Krishnaprasad, M.5
-
19
-
-
3142592507
-
Expressing and optimizing sequence queries in database systems
-
R. Sadri, C. Zaniolo, A. Zarkesh, and J. Adibi. Expressing and Optimizing Sequence Queries in Database Systems. ACM Trans. on Database Systems, 29(2), 2004.
-
(2004)
ACM Trans. on Database Systems
, vol.29
, Issue.2
-
-
Sadri, R.1
Zaniolo, C.2
Zarkesh, A.3
Adibi, J.4
-
24
-
-
0000386785
-
Finding approximate patterns in strings
-
E. Ukkonen. Finding approximate patterns in strings. J. Algorithms, 6(1):132-137, 1985.
-
(1985)
J. Algorithms
, vol.6
, Issue.1
, pp. 132-137
-
-
Ukkonen, E.1
|