• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Shortest unique substring query revisited

      Thumbnail
      View / Download
      253.5 Kb
      Author
      Ileri, Atalay Mert
      Külekci, M.O.
      Xu, B.
      Date
      2014
      Source Title
      Combinatorial Pattern Matching
      Print ISSN
      0302-9743
      Publisher
      Springer, Cham
      Volume
      8486
      Pages
      172 - 181
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      165
      views
      884
      downloads
      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.
      Keywords
      Pattern matching
      Auxiliary data structures
      Empirical studies
      Longest common prefixes
      Space efficient
      Substring
      Time and space algorithms
      Trees (mathematics)
      Permalink
      http://hdl.handle.net/11693/27552
      Published Version (Please cite this version)
      https://doi.org/10.1007/978-3-319-07566-2_18
      https://doi.org/10.1007/978-3-319-07566-2
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy