• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Simple linear work suffix array construction (2003)

Cached

  • Download as a PDF

Download Links

  • [www.mathcs.emory.edu]
  • [www.mpi-sb.mpg.de]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.helsinki.fi]
  • [www.cs.helsinki.fi]
  • [www.cs.cmu.edu]
  • [www.facweb.iitkgp.ernet.in]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.facweb.iitkgp.ernet.in]
  • [www.cs.helsinki.fi]
  • [goanna.cs.rmit.edu.au]
  • [goanna.cs.rmit.edu.au]
  • [www.cs.helsinki.fi]
  • [www.cs.cmu.edu]
  • [www.cs.helsinki.fi]
  • [algo2.iti.kit.edu]
  • [www.stefan-burkhardt.net]
  • [www.math.pku.edu.cn]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Juha Kärkkäinen , Peter Sanders , Stefan Burkhardt
Citations:215 - 8 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Kärkkäinen03simplelinear,
    author = {Juha Kärkkäinen and Peter Sanders and Stefan Burkhardt},
    title = {Simple linear work suffix array construction},
    booktitle = {},
    year = {2003},
    pages = {943--955},
    publisher = {Springer}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more explicit structure. We narrow this gap between theory and practice with a simple linear-time construction algorithm for suffix arrays. The simplicity is demonstrated with a C++ implementation of 50 effective lines of code. The algorithm is called DC3, which stems from the central underlying concept of difference cover. This view leads to a generalized algorithm, DC, that allows a space-efficient implementation and, moreover, supports the choice of a space–time tradeoff. For any v ∈ [1, √ n], it runs in O(vn) time using O(n / √ v) space in addition to the input string and the suffix array. We also present variants of the algorithm for several parallel and hierarchical memory models of computation. The algorithms for BSP and EREW-PRAM models are asymptotically faster than all previous suffix tree or array construction algorithms.

Keyphrases

suffix array    suffix tree    space-efficient implementation    previous suffix    simple linear-time construction algorithm    hierarchical memory model    space time tradeoff    linear-time construction algorithm    present variant    generalized algorithm    erew-pram model    difference cover    interchangeable index structure    space efficiency    explicit structure    input string    central underlying concept    array construction algorithm    effective line    several parallel   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University