NDLI: Suffix Sorting via Shannon-Fano-Elias Codes

Content Provider	IEEE Xplore Digital Library
Author	Adjeroh, D. Fei Nan
Copyright Year	2008
Description	Author affiliation: West Virginia Univ., Morgantown (Adjeroh, D.; Fei Nan)
Abstract	We propose two algorithms for the direct suffix sorting problem. The first is a simple algorithm that runs in an O(n) average time and space complexity, but with a worst case complexity in O(n log n) time and O(n) space. The second algorithm improves the first algorithm to O(n) time and space in the worst case. The improved algorithm requires only 7n bytes of storage, including the n bytes for the original string, and the 4n bytes for the suffix array. We take a general divide and conquer approach: divide the sequence into two groups; construct the suffix array for the first group; construct the suffix array for the second group, based on the sorted suffix from the first; Merge the suffix arrays from the two groups to form the suffix array for the parent sequence; Perform the above steps recursively to construct the complete suffix array for the entire sequence. Given a string of length n, our algorithm runs in O(n) worst case time and space. Our algorithm differs from previous approaches in the use of a simple partitioning step, and how it exploits this simple partitioning scheme for conflict resolution, using the notion of conflict trees. The basis of our improved algorithm is an extension of Shannon-Fano-Elias codes used in information theory. The space requirement for the proposed algorithm is 7n bytes, including the n bytes required to store the original string. This is a significant improvement when compared with the 13n bytes required by the KS algorithm. The method is also unique in its use of Shannon-Fano-Elias codes in efficient suffix sorting. To our knowledge, this is the first time information- theoretic methods have been used as the basis for solving the suffix sorting problem.
Starting Page	502
Ending Page	502
File Size	92588
Page Count	1
File Format	PDF
ISBN	9780769531212
ISSN	10680314
DOI	10.1109/DCC.2008.99
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-03-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Sorting Partitioning algorithms Information theory Data compression Computer science Buildings Tree data structures Data structures Algorithm design and analysis Taxonomy information theory Suffix sorting suffix trees suffix arrays space efficiency prefix codes
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Suffix-Sorting via Shannon-Fano-Elias Codes

Data compression conference suffix sorting via shannon-fano-elias codes ∗.

Using Improved Shannon-Fano-Elias Codes for Data Encryption

Compressed by the suffix tree

On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays

Fast Construction of Nearly-Optimal Prefix Codes without Probability Sorting

Efficient lossless compression of trees and graphs

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Suffix Sorting via Shannon-Fano-Elias Codes

Similar Documents

Suffix-Sorting via Shannon-Fano-Elias Codes

Data compression conference suffix sorting via shannon-fano-elias codes ∗.

Using Improved Shannon-Fano-Elias Codes for Data Encryption

Compressed by the suffix tree

On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays

Fast Construction of Nearly-Optimal Prefix Codes without Probability Sorting

Efficient lossless compression of trees and graphs

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Suffix Sorting via Shannon-Fano-Elias Codes