Abstract
We present an optimal, linear time algorithm for the shortest unique substring problem, thus improving the algorithm by Pei et al. (ICDE 2013). Our implementation is simple and based on suffix arrays. Computational experiments show that our algorithm is much more efficient in practice, compared to that of Pei et al.
| Original language | English |
|---|---|
| Title of host publication | SOFSEM 2014 |
| Subtitle of host publication | Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings |
| Publisher | Springer Verlag |
| Pages | 503-513 |
| Number of pages | 11 |
| ISBN (Print) | 9783319042978 |
| DOIs | |
| Publication status | Published - Jan 1 2014 |
| Event | 40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 - Novy Smokovec, Slovakia Duration: Jan 26 2014 → Jan 29 2014 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 8327 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 |
|---|---|
| Country | Slovakia |
| City | Novy Smokovec |
| Period | 1/26/14 → 1/29/14 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Tsuruta, K., Inenaga, S., Bannai, H., & Takeda, M. (2014). Shortest unique substrings queries in optimal time. In SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 503-513). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8327 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_44