Show simple item record

dc.contributor.authorIleri, Atalay Merten_US
dc.contributor.authorKülekci, M.O.en_US
dc.contributor.authorXu, B.en_US
dc.coverage.spatialMoscow, Russiaen_US
dc.date.accessioned2016-02-08T11:56:23Z
dc.date.available2016-02-08T11:56:23Z
dc.date.issued2014en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27552
dc.descriptionConference name: 25th Annual Symposium, CPM 2014en_US
dc.descriptionDate of Conference: June 16-18, 2014en_US
dc.description.abstractWe revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (ICDE'13). We propose an optimal O(n) time and space algorithm that can find an SUS for every location of a string of size n and thus significantly improve their O(n 2) time complexity. Our method also supports finding all the SUSes covering every location, whereas theirs can find only one SUS for every location. Further, our solution is simpler and easier to implement and can also be more space efficient in practice, since we only use the inverse suffix array and the longest common prefix array of the string, while their algorithm uses the suffix tree of the string and other auxiliary data structures. Our theoretical results are validated by an empirical study that shows our method is much faster and more space-saving. © 2014 Springer International Publishing Switzerland.en_US
dc.language.isoEnglishen_US
dc.source.titleCombinatorial Pattern Matchingen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-319-07566-2_18en_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-319-07566-2en_US
dc.subjectPattern matchingen_US
dc.subjectAuxiliary data structuresen_US
dc.subjectEmpirical studiesen_US
dc.subjectLongest common prefixesen_US
dc.subjectSpace efficienten_US
dc.subjectSubstringen_US
dc.subjectTime and space algorithmsen_US
dc.subjectTrees (mathematics)en_US
dc.titleShortest unique substring query revisiteden_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage172en_US
dc.citation.epage181en_US
dc.citation.volumeNumber8486en_US
dc.identifier.doi10.1007/978-3-319-07566-2_18en_US
dc.identifier.doi10.1007/978-3-319-07566-2en_US
dc.publisherSpringer, Chamen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record