ICONIC INDEXING BY 2-D STRINGS

[1] BASL PJ, 1985, ACM COMPUT SURVEYS, V17, P75

[2] Chang N. S., 1979, Proceedings of COMPSAC the IEEE Computer Society's Third International Computer Software and Applications Conference, P325

[3] RECONSTRUCTION OF BINARY PATTERNS FROM THEIR PROJECTIONS [J]. COMMUNICATIONS OF THE ACM, 1971, 14 (01) : 21 - &

[4] CHANG SK, 1986, NOV P FJCC 86 DALL

[5] CHANG SK, 1981, COMPUTER, P13

[6] CHANG SK, 1984, IEEE T PATTERN A JUL, P475

[7] CHANG SK, 1984, NOV IEEE P LANG AUT, P38

[8] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J]. JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675

[9] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (05) : 350 - 353

[10] THE QUADTREE AND RELATED HIERARCHICAL DATA-STRUCTURES [J]. COMPUTING SURVEYS, 1984, 16 (02) : 187 - 260

[1] BASL PJ, 1985, ACM COMPUT SURVEYS, V17, P75

[2] Chang N. S., 1979, Proceedings of COMPSAC the IEEE Computer Society's Third International Computer Software and Applications Conference, P325

[3] RECONSTRUCTION OF BINARY PATTERNS FROM THEIR PROJECTIONS [J]. COMMUNICATIONS OF THE ACM, 1971, 14 (01) : 21 - &

[4] CHANG SK, 1986, NOV P FJCC 86 DALL

[5] CHANG SK, 1981, COMPUTER, P13

[6] CHANG SK, 1984, IEEE T PATTERN A JUL, P475

[7] CHANG SK, 1984, NOV IEEE P LANG AUT, P38

[8] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J]. JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675

[9] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (05) : 350 - 353

[10] THE QUADTREE AND RELATED HIERARCHICAL DATA-STRUCTURES [J]. COMPUTING SURVEYS, 1984, 16 (02) : 187 - 260