Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    New suffix array algorithms - linear but not fast?

    135454_19229_10.1.1.68.4292.pdf (234.1Kb)
    Access Status
    Open access
    Authors
    Antonitio, A.
    Ryan, P.
    Smyth, Bill
    Turpin, A.
    Yu, X.
    Date
    2004
    Type
    Conference Paper
    
    Metadata
    Show full item record
    Citation
    Antonitio, A. and Ryan, P. and Smyth, W. and Turpin, A. and Yu, X. 2004. New suffix array algorithms - linear but not fast?, in Hong, S. (ed), 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), pp. 148-156. Ballina, Australia: Australian Computer Society.
    Source Title
    Proceedings of the 15th Australasian workshop on combinatorial algorithms (AWOCA)
    Source Conference
    15th Australasian Workshop on Combinatorial Algorithms (AWOCA)
    Faculty
    School of Science and Computing
    Department of Computing
    Faculty of Science and Engineering
    URI
    http://hdl.handle.net/20.500.11937/36803
    Collection
    • Curtin Research Publications
    Abstract

    In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a string x = x[1..n] on an indexed alphabet, all of them inspired by the methodology of Farach's (-)(n)- time suffix tree construction algorithm. In the same year a (-)(m)-time algorithm was described for computing all the occurrences of a pattern p = p[1..m] in x, given a suffix array of x and various other (-)(n) - space data structures. We analyze the effectiveness and limitations of these algorithms, especially in terms of execution time, and we discuss strategies for their improvement.

    Related items

    Showing items related by title, author, creator and subject.

    • Sorting suffixes of two-pattern strings
      Franek, F.; Smyth, Bill (2004)
      Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: ...
    • A taxonomy of suffix array construction algorithms
      Puglisi, Simon; Smyth, William; Turpin, A. (2007)
      In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few ...
    • Lempel-Ziv factorization using less time & space
      Chen, G.; Puglisi, Simon; Smyth, B. (2008)
      For 30 years the Lempel-Ziv factorization LZ x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.