Shortest Unique Substring Query Revisited

@inproceedings{Ileri2014ShortestUS,
  title={Shortest Unique Substring Query Revisited},
  author={Atalay Mert Ileri and M. Oguzhan K{\"u}lekci and Bojian Xu},
  booktitle={CPM},
  year={2014}
}
We revisit the problem of finding shortest unique substring ( SUS) proposed recently by [6]. We propose an optimalO(n) time and space algorithm that can find an SUS for every locatio n of a string of sizen. Our algorithm significantly improves the O(n) time complexity needed by [6]. We also support finding all the SUSes covering every location, whereas the solution in [6] can find o ly one SUS for every location. Further, our solution is simpler and easier to implement and can also be more… CONTINUE READING
Tweets
This paper has been referenced on Twitter 3 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…