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

    Inverted files versus suffix arrays for locating patterns in primary memory

    Access Status
    Fulltext not available
    Authors
    Puglisi, Simon
    Smyth, William
    Turpin, Andrew
    Date
    2006
    Type
    Conference Paper
    
    Metadata
    Show full item record
    Citation
    Puglisi, Simon J. and Smyth, W.F. and Turpin, Andrew. 2006. Inverted files versus suffix arrays for locating patterns in primary memory, in Fabio Crestani (ed), 13th Symposium on String Processing and Information Retrieval (SPIRE), Oct 11 2006, pp. 122-133. Glasgow, UK: Springer.
    Source Title
    Inverted files versus suffix arrays for locating patterns in primary memory
    Source Conference
    13th Symposium on String Processing and Information Retrieval (SPIRE)
    DOI
    10.1007/11880561_11
    ISBN
    978-3-540-45774-9
    Faculty
    Curtin Business School
    The Digital Ecosystems and Business Intelligence Institute (DEBII)
    School
    Other
    Remarks

    The original publication is available at : http://www.springerlink.com

    URI
    http://hdl.handle.net/20.500.11937/43428
    Collection
    • Curtin Research Publications
    Abstract

    Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key rival structure, the compressed inverted file, has been dismissed or ignored in papers presenting the new structures. In this paper we examine the resource requirements of compressed suffix array algorithms against compressed inverted file data structures for general pattern matching in genomic and English texts. In both cases, the inverted file indexes q-grams, thus allowing full pattern matching capabilities, rather than simple word based search, making their functionality equivalent to the compressed suffix array structures. When using equivalent memory for the two structures, inverted files are faster at reporting the location of patterns when the number of occurrences of the patterns is high.

    Related items

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

    • Suffix arrays: what are they good for?
      Puglisi, Simon; Smyth, Bill; Turpin, A. (2006)
      Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have ...
    • 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) ...
    • New suffix array algorithms - linear but not fast?
      Antonitio, A.; Ryan, P.; Smyth, Bill; Turpin, A.; Yu, X. (2004)
      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 ...
    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.