Name
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. |
Year | Venue | Keywords |
|---|---|---|
2009 | PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009 | parallel algorithm |
Field | DocType | Citations |
String searching algorithm,Commentz-Walter algorithm,Computer science,Binary strings,Parallel algorithm,Parallel computing,General-purpose computing on graphics processing units,Boyer–Moore string search algorithm,Cost efficiency | Conference | 3 |
PageRank | References | Authors |
0.43 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kazunori Hirashima | 1 | 3 | 0.43 |
| Hideo Bannai | 2 | 620 | 79.87 |
| Wataru Matsubara | 3 | 52 | 5.87 |
| Akira Ishino | 4 | 54 | 7.31 |
| Ayumi Shinohara | 5 | 936 | 88.28 |