Academic Commons

Reports

Approximate String Matching on the DADO2 Parallel Computer

Mori, Toshikatsu; Stolfo, Salvatore

This paper presents an approximate string matching algorithm on the 1023-processor parallel computer DADO2. To allow proximity in matching between the text and search pattern, the dynamic programming method is used as the matching algorithm. This paper includes timing measurements and comparison with a conventional sequential computer (VAX). The results show significant speedup over the sequential computer.

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-361-88
Published Here
December 19, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.