Sciweavers

CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 9 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...