TY - GEN
T1 - Bit-parallel algorithms for computing all the runs in a string
AU - Hirashima, Kazunori
AU - Bannai, Hideo
AU - Matsubara, Wataru
AU - Ishino, Akira
AU - Shinohara, Ayumi
PY - 2009/12/1
Y1 - 2009/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84867555933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867555933&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84867555933
SN - 9788001044032
T3 - Proceedings of the Prague Stringology Conference 2009
SP - 203
EP - 213
BT - Proceedings of the Prague Stringology Conference 2009
T2 - Prague Stringology Conference 2009, PSC 2009
Y2 - 31 August 2009 through 2 September 2009
ER -