Suffix-Sorting via Shannon-Fano-Elias Codes

Algorithms

Donald Adjeroh¹ 

关键词: suffix sorting;    suffix arrays;    suffix tree;    Shannon-Fano-Elias codes;    source coding;   

DOI  :  10.3390/a3020145

来源: mdpi

【 摘 要 】

Given a sequence , and 4 bytes per integer. The basis of our algorithm is an extension of Shannon-Fano-Elias codes used in source coding and information theory. This is the first time information-theoretic methods have been used as the basis for solving the suffix sorting problem.

【 授权许可】

CC BY   
© 2010 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland.