- See here
for new lower bounds on the maximum number of runs function
The maximum number of runs in a string is less than its length!
- compressed string processing
- pattern discovery
- correlated pattern discovery algorithm
find and count the number of runs (maximal repetitions) in a string.
simple algorithm for calculating the Lempel-Ziv (LZ77)
factorization of a string.
- bgone (mostly by Keisuke Goto):
another algorithm for calculating the Lempel-Ziv (LZ77)
factorization of a string that uses only a single integer array.
algorithm for calculating shortest unique substring queries in optimal time.
- List of Publications
Department of Informatics, Kyushu University
744 Moto-oka, Nishi-ku, Fukuoka 819-0395, Japan.
Phone: +81-92-802-3789 Fax: +81-92-802-3600
E-mail: bannai a t m a r k inf dot kyushu-u dot ac dot jp