### 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 language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference 2009 |

Pages | 203-213 |

Number of pages | 11 |

Publication status | Published - 2009 Dec 1 |

Event | Prague Stringology Conference 2009, PSC 2009 - Prague, Czech Republic Duration: 2009 Aug 31 → 2009 Sep 2 |

### Publication series

Name | Proceedings of the Prague Stringology Conference 2009 |
---|

### Other

Other | Prague Stringology Conference 2009, PSC 2009 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 09/8/31 → 09/9/2 |

### ASJC Scopus subject areas

- 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).