<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06104417</id>
  <dt>a</dt>
  <an>06104417</an>
  <augroup>
    <au>Tran, Tuan Tu</au>
    <au>Giraud, Mathieu</au>
    <au>Varr\'e, Jean-St\'ephane</au>
  </augroup>
  <ti>Bit-parallel multiple pattern matching.</ti>
  <so>Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11--14, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-31499-5/pbk). Lecture Notes in Computer Science 7204, 292-301 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>bit parallelism</ut>
    <ut>pattern matching</ut>
    <ut>sequence comparison</ut>
    <ut>neighborhood indexing</ut>
    <ut>GPU</ut>
    <ut>OpenCL</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31500-8_30</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Text matching with errors is a regular task in computational biology. We present an extension of the bit-parallel Wu-Manber algorithm [16] to combine several searches for a pattern into a collection of fixed-length words. We further present an OpenCL parallelization of a redundant index on massively parallel multicore processors, within a framework of searching for similarities with seed-based heuristics. We successfully implemented and ran our algorithms on GPU and multicore CPU. Some speedups obtained are more than $60\times $.</ab>
    <rv></rv>
  </abgroup>
</item>