TY - GEN
T1 - Shortest unique substrings queries in optimal time
AU - Tsuruta, Kazuya
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
PY - 2014/1/1
Y1 - 2014/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84958525527&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958525527&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-04298-5_44
DO - 10.1007/978-3-319-04298-5_44
M3 - Conference contribution
AN - SCOPUS:84958525527
SN - 9783319042978
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 503
EP - 513
BT - SOFSEM 2014
PB - Springer Verlag
T2 - 40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014
Y2 - 26 January 2014 through 29 January 2014
ER -