Chancellery Research - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/377

Filters

2006 - 2009 6
Reset filters

Settings
Statistics
Citations
Author: Turpin, Andrew × Start date: 2006 × End date: 2009 ×

Search Results

Now showing 1 - 6 of 6
  • Item
    Thumbnail Image
    2 Document Compaction for Efficient Query Biased Snippet Generation
    Tsegay, Y ; Puglisi, SJ ; Turpin, A ; Zobel, J ; Boughanem, M ; Berrut, C ; Mothe, J ; SouleDupuy, C (SPRINGER-VERLAG BERLIN, 2009-01-01)
  • Item
    Thumbnail Image
    Examining the pseudo-standard web search engine results page
    Turpin, A ; Billerbeck, B ; Scholer, F ; Abel, LA (Queensland University of Technology, 2006-12-01)
  • Item
    Thumbnail Image
    Aggregated click-through data in a homogeneous user community
    Wu, M ; Turpin, A ; Zobel, J (ACM Press, 2008-12-15)
  • Item
    Thumbnail Image
    A new periodicity lemma
    Fan, K ; Puglisi, SJ ; Smyth, WF ; Turpin, A (SIAM PUBLICATIONS, 2006-01-01)
  • Item
    Thumbnail Image
    Entropy of the Retina Template
    Arakala, A ; Culpepper, JS ; Jeffers, J ; Turpin, A ; Boztas, S ; Horadam, KJ ; McKendrick, AM ; Tistarelli, M ; Nixon, MS (SPRINGER-VERLAG BERLIN, 2009-01-01)
  • Item
    Thumbnail Image
    A taxonomy of suffix array construction algorithms
    Publisi, SJ ; Smyth, WF ; Turpin, AH (ASSOC COMPUTING MACHINERY, 2007-01-01)
    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 years, suffix array construction algorithms have proliferated in bewildering abundance. This survey paper attempts to provide simple high-level descriptions of these numerous algorithms that highlight both their distinctive features and their commonalities, while avoiding as much as possible the complexities of implementation details. New hybrid algorithms are also described. We provide comparisons of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.