Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Bioinformatics Data processing"”.

  1. A multiprocessor parallel approach to bit-parallel approximate string matching

    … 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 …

    csusb Repository record for A multiprocessor parallel approach to bit-parallel approximate string matching (opens in a new tab)

  2. A multiprocessor parallel approach to bit-parallel approximate string matching

    … 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 …

    csusb-retro Repository record for A multiprocessor parallel approach to bit-parallel approximate string matching (opens in a new tab)