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

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

研究成果: Conference 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.

本文言語English
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2009
ページ203-213
ページ数11
出版ステータスPublished - 2009 12月 1
イベントPrague Stringology Conference 2009, PSC 2009 - Prague, Czech Republic
継続期間: 2009 8月 312009 9月 2

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2009

Other

OtherPrague Stringology Conference 2009, PSC 2009
国/地域Czech Republic
CityPrague
Period09/8/3109/9/2

ASJC Scopus subject areas

  • 数学 (全般)

フィンガープリント

「Bit-parallel algorithms for computing all the runs in a string」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル