Back to search

CSUniversity San Bernardino

A multiprocessor parallel approach to bit-parallel approximate string matching

Abstract

dc:description.abstract

The purpose of this project is to present with empirical results that a parallel design with the use of multiple processors can be successfully applied along with bit-parallel approximate string matching algorithms to solve practical bioinformatics problems. It will demonstrate that nearly optimal speedup can be achieved with a cluster of between two and eight workstations using MPI (Message Passing Interface), directly decreasing the total latency required to perform a string matching problem.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Computer Science and Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chibli, Elias Anwar
Contributors dc:contributor
  • Schubert, Keith Evan
  • Gomez, Ernesto
  • Karant, Yasha

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/3489

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chibli, Elias Anwar. A multiprocessor parallel approach to bit-parallel approximate string matching. Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/3489