Bit-parallel algorithms for computing all the runs in a string

Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We present three bit-parallel algorithms for computing all the runs in a string. The algorithms are very efficient especially for computing all runs of short binary strings, allowing us to run the algorithm for all binary strings of length up to 47 in a few days, using a PC with the help of GPGPU. We also present some related statistics found from the results.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2009
Pages203-213
Number of pages11
Publication statusPublished - Dec 1 2009
EventPrague Stringology Conference 2009, PSC 2009 - Prague, Czech Republic
Duration: Aug 31 2009Sep 2 2009

Publication series

NameProceedings of the Prague Stringology Conference 2009

Other

OtherPrague Stringology Conference 2009, PSC 2009
CountryCzech Republic
CityPrague
Period8/31/099/2/09

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Bit-parallel algorithms for computing all the runs in a string'. Together they form a unique fingerprint.

  • Cite this

    Hirashima, K., Bannai, H., Matsubara, W., Ishino, A., & Shinohara, A. (2009). Bit-parallel algorithms for computing all the runs in a string. In Proceedings of the Prague Stringology Conference 2009 (pp. 203-213). (Proceedings of the Prague Stringology Conference 2009).