FBWTMEM : computing maximal exact matches with FBWT

Finding maximal exact matches (MEMs) is an important building block of many workloads including genome alignment.
Hence its acceleration has a great impact on genome alignment and genome analysis workloads.
In this paper, we developed a new algorithm, FBWTMEM, for this task, and experimentally showed that our algorithm outperforms previous ones.
We achieved 1) a smaller memory footprint by using a recently-proposed data structure called FBWT and 2) a faster execution time by adaptively tuning the skip parameter.

By: Masaru Ito, Hiroshi Inoue, Megumi Ito and Moriyoshi Ohara

Published in: RT0981 in 2017


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .