SCOPUS 정보 검색 플랫폼

Volumn 1992-October, Issue , 1992, Pages 247-256

Truly alphabet-independent two-dimensional pattern matching

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; TEXT PROCESSING;

EQUALITY TESTS; STRING MATCHING; TWO-DIMENSIONAL PATTERN MATCHING; TWO-DIMENSIONAL PROBLEM;

ONE DIMENSIONAL;

EID: 85030054926 PISSN: 02725428 EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/SFCS.1992.267767 Document Type: Conference Paper

Times cited : (58)

References (12)

1
- 0016518897
- Efficient string matching: An aid to bibliographic search
- A.V. Aho and M.J. Corasick, Efficient string matching: An aid to bibliographic search, CACM 18 (1975), 333-340.
- (1975) CACM , vol.18 , pp. 333-340
- Aho, A.V.¹ Corasick, M.J.²

2
- 85030052368
- Two-dimensional periodicity and its applications
- A. Amir and G. Benson, Two-dimensional periodicity and its applications, Proc. 3rd SODA, 1992, 440-452.
- (1992) Proc. 3rd SODA , pp. 440-452
- Amir, A.¹ Benson, G.²

3
- 0026992709
- Alphabet independent two dimensional matching
- A. Amir, G. Benson and M. Farach, Alphabet independent two dimensional matching, Proc. 24th STOC, 1992, 59-68.
- (1992) Proc. 24th STOC , pp. 59-68
- Amir, A.¹ Benson, G.² Farach, M.³

4
- 85029739324
- Efficient pattern matching with scaling
- A. Amir, G. Landau and U. Vishkin, Efficient pattern matching with scaling, Proc. 1st SODA, 1990, 344-357.
- (1990) Proc. 1st SODA , pp. 344-357
- Amir, A.¹ Landau, G.² Vishkin, U.³

5
- 0000253404
- A technique for extending rapid exact-match string matching to arrays of more than one dimension
- T.J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. on Comput. 7 (1978), 533-541.
- (1978) SIAM J. on Comput , vol.7 , pp. 533-541
- Baker, T.J.¹

6
- 0000390045
- Two dimensional pattern matching
- R.S. Bird, Two dimensional pattern matching, Inform. Process. Lett. 6 (1977), 168-170.
- (1977) Inform. Process. Lett , vol.6 , pp. 168-170
- Bird, R.S.¹

7
- 0025631378
- An optimal 0(log log n) time parallel string matching algorithm
- D. Breslauer and Z. Galil, An optimal 0(log log n) time parallel string matching algorithm, SIAM J. on Comput. 19 (1990), 1051-1058.
- (1990) SIAM J. on Comput , vol.19 , pp. 1051-1058
- Breslauer, D.¹ Galil, Z.²

8
- 0022030599
- Efficient randomized pattern-matching algorithms
- R.M. Karp and M.O. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. and Dev. (1987), 249-260.
- (1987) IBM J. Res. and Dev , pp. 249-260
- Karp, R.M.¹ Rabin, M.O.²

9
- 0000904908
- Fast pattern matching in strings
- D.E. Knuth, J.H. Morris, and V.B. Pratt, Fast pattern matching in strings, SIAM J. on Comput. 6 (1977), 323-350.
- (1977) SIAM J. on Comput , vol.6 , pp. 323-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.B.³

10
- 0001338917
- An O(n log n) algorithm for finding all repetitions in a string
- M.G. Main and R.J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984), 422-432.
- (1984) J. Algorithms , vol.5 , pp. 422-432
- Main, M.G.¹ Lorentz, R.J.²

11
- 0022142469
- Optimal parallel pattern matching in strings
- U. Vishkin, Optimal parallel pattern matching in strings, Inform, and Control 67 (1985), 91-113.
- (1985) Inform, and Control , vol.67 , pp. 91-113
- Vishkin, U.¹

12
- 0024733357
- A technique for two-dimensional pattern matching
- R.F. Zhu and T. Takaoka, A technique for two-dimensional pattern matching, CACM 32 (1989), 1110-1120.
- (1989) CACM , vol.32 , pp. 1110-1120
- Zhu, R.F.¹ Takaoka, T.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.