{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-project-4573"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-project-4573","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"A multiprocessor parallel approach to bit-parallel approximate string matching","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chibli, Elias Anwar"],"institution":null,"degree_name":"Master of Science in Computer Science","degree_level":"Thesis","degree_discipline":"School of Computer Science and Engineering","degree_department":null,"school":null,"contributors":["Schubert, Keith Evan","Gomez, Ernesto","Karant, Yasha"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:07:53Z","subjects":["Bioinformatics Data processing","Computer algorithms","Pattern recognition systems","Parallel processing (Electronic computers)","Pattern recognition systems.","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd-project/3489","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd-project/3489","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-project-4573","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Schubert, Keith Evan","Gomez, Ernesto","Karant, Yasha"]},{"key":"dc:creator","label":"Author","values":["Chibli, Elias Anwar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2008-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["School of Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bioinformatics Data processing","Computer algorithms","Pattern recognition systems","Parallel processing (Electronic computers)","Pattern recognition systems.","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd-project/3489"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["A multiprocessor parallel approach to bit-parallel approximate string matching"]}]}],"canonical_facts":{"dc:contributor":["Schubert, Keith Evan","Gomez, Ernesto","Karant, Yasha"],"dc:creator":["Chibli, Elias Anwar"],"dc:date.created":["2008-01-01T08:00:00Z"],"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."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd-project/3489"],"dc:subject":["Bioinformatics Data processing","Computer algorithms","Pattern recognition systems","Parallel processing (Electronic computers)","Pattern recognition systems.","Theory and Algorithms"],"dc:title":["A multiprocessor parallel approach to bit-parallel approximate string matching"],"thesis:degree_discipline":["School of Computer Science and Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science in Computer Science"]},"updated_at":"2026-11-19T08:07:53Z"}