There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. This paper evaluates three different schemes for overcoming this problem. First it proposes to replace the character code table by a character code automaton. Then it compares this method with two other schemes: using a hash table, and the binary-search based solution proposed by Wu, Manber and Myers. The paper finds that the best choice is to use either the automaton-based method or a hash table.
Did you find this white paper useful?
Related white papers
IBM Virtualization Manager Demo
IBM Virtualization Manager allows you to discover, visualize, and manage both physical and virtual systems from a single console. View the demo to learn more.
IBM Virtualization Manager Demo
IBM Virtualization Manager allows you to discover, visualize, and manage both physical and virtual systems from a single console. View the demo to learn more.
Deploying Application and OS Virtualization Together: Citrix and Parallels Virtuozzo Containers
As virtualization becomes more pervasive in the datacenter, organizations are deploying complementary types of virtualization technologies. Read this white paper to learn how blending application and OS virtualization using Citrix and...
A 10000 Fps CMOS Sensor With Massively Parallel Image Processing
A high speed analog VLSI image acquisition and pre-processing system has been designed and fabricated in a 0.35 µm standard CMOS process. The chip features a massively parallel architecture enabling...
Efficiency of Distributed Parallel Processing Using Java RMI, Sockets, and CORBA
Software development is proceeding at a remarkable rate. Many new tools are available to the researcher in parallel and distributed processing. These tools include PVM, MPI, and Java. But, recently,...
Parallel Processing Applied to the Design of Concrete Encased Grounding Electrodes
This work presents the authors' investigation regarding the application of parallel processing to the design of grounding systems, comprising concrete encased electrodes. The natural parallelism of the involved tasks and...
Optimizing Parallel Itineraries for KNN Query Processing in Wireless Sensor Networks
Spatial queries for extracting data from wireless sensor net-works are important for many applications, such as environmental monitoring and military surveillance. One such query is K Nearest Neighbor (KNN) query...
