KUKU

KU ScholarWorks

  • myKU
  • Email
  • Enroll & Pay
  • KU Directory
    • Login
    View Item 
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform (Extended Abstract)

    Thumbnail
    View/Open
    anl08_018guptaa.pdf (1.125Mb)
    Issue Date
    2008-01
    Author
    Gupta, Ankur
    Grossi, Roberto
    Vitter, Jeffrey Scott
    Publisher
    Society for Industrial and Applied Mathematics
    Type
    Article
    Article Version
    Scholarly/refereed, publisher version
    Published Version
    http://www.siam.org/proceedings/analco/2008/anl08_018guptaa.pdf
    Metadata
    Show full item record
    Abstract
    In this paper, we present a nearly tight analysis of the encoding length of the Burrows-Wheeler Transform (bwt) that is motivated by the text indexing setting.For a text T of n symbols drawn from an alphabet , our encoding scheme achieves bounds in terms of the hth-order empirical entropy Hh of the text, and takes linear time for encoding and decoding. We also describe a lower bound on the encoding length of the bwt that constructs an in nite (non-trivial) class of texts that are among the hardest to compress using the bwt. We then show that our upper bound encoding length is nearly tight with this lower bound for the class of texts we described. In designing our bwt encoding and its lower bound, we also address the t-subset problem; here, the goal is to store a subset of t items drawn from a universe [1
    URI
    http://hdl.handle.net/1808/7193
    Collections
    • Provost Office Published Articles [95]
    • Electrical Engineering and Computer Science Scholarly Works [288]
    • Distinguished Professors Scholarly Works [918]
    Citation
    R. Grossi, A. Gupta, and J. S. Vitter. “Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform,” in preparation. An extended abstract appears in Proceedings of the 5th Workshop on Analytical Algorithmics and Combinatorics (ANALCO ’08), San Francisco, CA, January 2008, 191–202

    Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.


    We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.


    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

    Browse

    All of KU ScholarWorksCommunities & CollectionsThis Collection

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

    The University of Kansas
      Contact KU ScholarWorks
    Lawrence, KS | Maps
     
    • Academics
    • Admission
    • Alumni
    • Athletics
    • Campuses
    • Giving
    • Jobs

    The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.

     Contact KU
    Lawrence, KS | Maps