8.20 I. Matching; Stereo

Chapter Contents (Back)

8.20.1 I.1. String, array, tree, and graph matching

Chapter Contents (Back)

Manber, U., Baeza-Yates, R.,
An Algorithm For String Matching With A Sequence Of Don'T Cares,
IPL(37), 1991, pp. 133-136. BibRef

Crochemore, M., Perrin, D.,
Two-Way String-Matching,
J. ACM(38), 1991, pp. 651-675. BibRef

Ranka, S., Heywood, T.,
Two-Dimensional Pattern Matching With K Mismatches,
PR(24), 1991, pp. 31-40. BibRef

Kuo, S., Cross, G.R.,
A Two-Step String Matching Procedure,
PR(24), 1991, pp. 711-716. BibRef

Vishkin, U.,
Deterministic Sampling-A New Technique For Fast Pattern Matching,
SIAM JC(20), 1991, pp. 22-40. BibRef

Galil, Z., Giancarlo, R.,
On The Exact Complexity Of String Matching: Lower Bounds,
SIAM JC(20), 1991, pp. 1008-1020. BibRef

Baeza-Yates, R.A.,
Searching Subsequences,
TCS(78), 1991, pp. 363-376. BibRef

Amir, A., Landau, G.M.,
Fast Parallel And Serial Multidimensional Approximate Array Matching,
TCS(81), 1991, pp. 97-115. BibRef


Hebrard, J.J.,
An Algorithm For Distinguishing Efficiently Bit-Strings By Their Subsequences,
TCS(82), 1991, pp. 35-49. BibRef

Crochemore, M., Rytter, W.,
Usefulness Of The Karp-Miller-Rosenberg Algorithm In Parallel Computations On Strings And Arrays,
TCS(88), 1991, pp. 59-82. BibRef

Dublish, P.,
Some Comments On The Subtree Isomorphism Problem For Ordered Trees,
IPL(36), 1990, pp. 273-275. BibRef

Luccio, F., Pagli, L.,
An Efficient Algorithm For Some Tree Matching Problems,
IPL(39), 1991, pp. 51-57. BibRef

Grossi, R.,
A Note On The Subtree Isomorphism For Ordered Trees And Related Problems,
IPL(39), 1991, pp. 81-84. BibRef

Owolabi, O.,
A Graph Canonization Method For Pattern Recognition,
PRL(12), 1991, pp. 701-705. BibRef

Esposito, F., Malerba, D., Semeraro, G.,
Flexible Matching For Noisy Structural Descriptions,
IJCAI(91), pp. 658-664. BibRef

Chapter on Rosenfeld Bibliography for 1991 continues in
I.2. Image, template, pattern, and shape matching .

Last update:Jun 7, 2018 at 10:14:50