A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm That Builds a Set of Strings Given Its Overlap Graph
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
DS '02 Proceedings of the 5th International Conference on Discovery Science
Distributed suffix trees and their application to large-scale genomic analysis
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Optimal prefix and suffix queries on texts
Information Processing Letters
Information Processing Letters
Distributed and paged suffix trees for large genetic databases
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Algorithms for three versions of the shortest common superstring problem
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Least random suffix/prefix matches in output-sensitive time
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.89 |