Space–time trade-offs for finding shortest unique substrings and maximal unique matches

Authors

Arnab Ganguly
Wing-Kai Hon
Rahul Shah
Sharma V. Thankachan

Document Type

Article

Publication Date

11-1-2017

Publication Source (Journal or Book title)

Theoretical Computer Science

First Page

75

Last Page

88

Recommended Citation

Ganguly, A., Hon, W., Shah, R., & Thankachan, S. V. (2017). Space–time trade-offs for finding shortest unique substrings and maximal unique matches. Theoretical Computer Science, 700, 75-88. https://doi.org/10.1016/j.tcs.2017.08.002