• Refine your search:
  • 
    Keyword:
    
    • suffix tree (2)
    • Algorithms (1)
    • Arrays (1)
    • Burrows–Wheeler transform ACM Reference Format (1)
    • Categories and Subject Descriptors (1)
    • Design (1)
    • E.1 [Data Structures (1)
    • F.2.2 [Analysis of Algorithms and Problem Complexity (1)
    • H.3.3 [Information Storage and Retrieval (1)
    • Information Search and Retrieval General Terms (1)
    •   more
  • 
    Creator / Publisher:
    
    • Simon J. Puglisi (14)
    • The Pennsylvania State University CiteSeerX Archives (14)
    • Gonzalo Navarro (4)
    • William F. Smyth (4)
    • Andrew Turpin (3)
    • Juha Kärkkäinen (2)
    • Matthias Petri (2)
    • Munina Yusufu (2)
    • Alistair Moffat (1)
    • Andrew H. Turpin (1)
    •   more
  • 
    Year
  • 
    Medium
  • 
    Type:
    
    • Article (14)
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 14 of 14 1 Permuted longest-common-prefix array Juha Kärkkäinen; Giovanni Manzini; Simon J. Puglisi In: http://www.seg.rmit.edu.au/research/download.php?manuscript=406 (2009) BASE Show details 2 Fast Optimal Algorithms for Computing All the Repeats in a String Simon J. Puglisi; William F. Smyth; Munina Yusufu In: http://www.seg.rmit.edu.au/research/download.php?manuscript=327 (2008) BASE Show details 3 Space-time tradeoffs for longest-common-prefix array computation Simon J. Puglisi; Andrew Turpin In: http://www.seg.rmit.edu.au/research/download.php?manuscript=246 (2008) BASE Show details 4 Improving Suffix Array Locality for Fast Pattern Matching on Disk Ranjan Sinha; Simon J. Puglisi; Alistair Moffat... In: http://www.seg.rmit.edu.au/research/download.php?manuscript=247 (2008) BASE Show details 5 Fast optimal algorithms for computing all the repeats in a string. Prague Stringology Club Simon J. Puglisi; William F. Smyth; Munina Yusufu In: http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D15%26t%3Dpdf%26y%3D2008 (2008) BASE Show details 6 A taxonomy of suffix array construction algorithms Simon J. Puglisi; W. F. Smyth; Andrew H. Turpin In: http://www.seg.rmit.edu.au/research/download.php?manuscript=218 (2007) Abstract: 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. Keyword: Algorithms; Arrays; Burrows–Wheeler transform ACM Reference Format; Categories and Subject Descriptors; Design; E.1 [Data Structures; F.2.2 [Analysis of Algorithms and Problem Complexity; H.3.3 [Information Storage and Retrieval; Information Search and Retrieval General Terms; Nonnumerical Algorithms and Problems; Performance Additional Key Words and Phrases; Suffix array; suffix sorting; suffix tree URL: http://www.seg.rmit.edu.au/research/download.php?manuscript=218 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.992 BASE Hide details 7 Suffix Arrays: What Are They Good for? Simon J. Puglisi; William F. Smyth In: http://crpit.com/confpapers/CRPITV49Puglisi.pdf (2006) BASE Show details 8 The performance of linear time suffix sorting algorithms Simon J. Puglisi; Andrew Turpin In: http://www.seg.rmit.edu.au/research/download.php?manuscript=259 BASE Show details 9 New and Efficient Approaches to the Quasiperiodic Characterisation of a String Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis... In: http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D08%26t%3Dpdf%26y%3D2012 BASE Show details 10 Backwards Search in Context Bound Text Transformations Matthias Petri; Gonzalo Navarro; Simon J. Puglisi In: http://goanna.cs.rmit.edu.au/~e76763/publications/pncp11-ccp.pdf BASE Show details 11 Practical Compressed Document Retrieval Gonzalo Navarro; Simon J. Puglisi; Daniel Valenzuela In: http://www.dcc.uchile.cl/%7Egnavarro/ps/sea11.2.pdf BASE Show details 12 Backwards Search in Context Bound Text Transformations Matthias Petri; Gonzalo Navarro; Simon J. Puglisi In: http://www.dcc.uchile.cl/%7Egnavarro/ps/ccp11.pdf BASE Show details 13 London WC2R 2LS Juha Kärkkäinen; Simon J. Puglisi In: http://www.cs.helsinki.fi/juha.karkkainen/publications/ccp2011.pdf BASE Show details 14 Document Listing on Repetitive Collections Travis Gagie; Kalle Karhu; Gonzalo Navarro... In: http://www.dcc.uchile.cl/~gnavarro/ps/cpm13.pdf BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 14 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0