Optimal parallel analysis and decomposition of partially occluded strings-Reference-Cited by-同舟云学术

Optimal parallel analysis and decomposition of partially occluded strings

Published:2000-03 Issue:4 Volume:26 Page:483-494
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Iliopoulos Costas S.,Reid James F.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference17 articles.

1. Optimal superprimitivity testing for strings;Apostolico;Information Processing Letters,1991

2. Learning structural descriptions of patterns: a new technique for conditional clustering and rule generation;Bischof;Pattern Recognition,1994

3. An optimal O(log logn) time parallel string matching algorithm;Breslauer;SIAM Journal of Computing,1990

4. Applications of approximate string matching to 2D shape recognition;Bunke;Pattern Recognition,1993

5. Reducing the size of hybridization chips for DNA sequence analysis;Duval;International Journal of Foundations of Computer Science,1996

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice;International Journal of Computer Mathematics;2002-01

2. Validation and Decomposition of Partially Occluded Images;SOFSEM 2002: Theory and Practice of Informatics;2002

3. DECOMPOSITION OF PARTIALLY OCCLUDED STRINGS IN THE PRESENCE OF ERRORS;International Journal of Pattern Recognition and Artificial Intelligence;2001-11