Shortest unique substring query revisited
dc.citation.epage | 181 | en_US |
dc.citation.spage | 172 | en_US |
dc.citation.volumeNumber | 8486 | en_US |
dc.contributor.author | Ileri, Atalay Mert | en_US |
dc.contributor.author | Külekci, M.O. | en_US |
dc.contributor.author | Xu, B. | en_US |
dc.coverage.spatial | Moscow, Russia | en_US |
dc.date.accessioned | 2016-02-08T11:56:23Z | |
dc.date.available | 2016-02-08T11:56:23Z | |
dc.date.issued | 2014 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Conference name: 25th Annual Symposium, CPM 2014 | en_US |
dc.description | Date of Conference: June 16-18, 2014 | en_US |
dc.description.abstract | We 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.description.provenance | Made available in DSpace on 2016-02-08T11:56:23Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2014 | en |
dc.identifier.doi | 10.1007/978-3-319-07566-2_18 | en_US |
dc.identifier.doi | 10.1007/978-3-319-07566-2 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27552 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Springer, Cham | en_US |
dc.relation.isversionof | https://doi.org/10.1007/978-3-319-07566-2_18 | en_US |
dc.relation.isversionof | https://doi.org/10.1007/978-3-319-07566-2 | en_US |
dc.source.title | Combinatorial Pattern Matching | en_US |
dc.subject | Pattern matching | en_US |
dc.subject | Auxiliary data structures | en_US |
dc.subject | Empirical studies | en_US |
dc.subject | Longest common prefixes | en_US |
dc.subject | Space efficient | en_US |
dc.subject | Substring | en_US |
dc.subject | Time and space algorithms | en_US |
dc.subject | Trees (mathematics) | en_US |
dc.title | Shortest unique substring query revisited | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Shortest unique substring query revisited.pdf
- Size:
- 253.45 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version