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

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2009
ページ203-213
ページ数11
出版物ステータス出版済み - 12 1 2009
イベントPrague Stringology Conference 2009, PSC 2009 - Prague, チェコ共和国
継続期間: 8 31 20099 2 2009

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2009

その他

その他Prague Stringology Conference 2009, PSC 2009
チェコ共和国
Prague
期間8/31/099/2/09

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

フィンガープリント Bit-parallel algorithms for computing all the runs in a string' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

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