Constructing LZ78 tries and position heaps in linear time for large alphabets
Authors:
- Yuto NakashimaYNYuto Nakashima
- Tomohiro ITITomohiro I
- Shunsuke InenagaSIShunsuke Inenaga
- Hideo BannaiHBHideo Bannai
- Masayuki TakedaMTMasayuki Takeda
- 1 September 2015
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 115 (9) , 655-659
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and SpaceAlgorithmica, 2013
- Position heaps: A simple and dynamic text indexing data structureJournal of Discrete Algorithms, 2011
- Compressing and indexing labeled trees, with applicationsJournal of the ACM, 2009
- The Level Ancestor Problem simplifiedTheoretical Computer Science, 2004
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring MatricesSIAM Journal on Computing, 2003
- The suffix tree of a tree and minimizing sequential transducersTheoretical Computer Science, 1998
- Improved Dynamic Dictionary MatchingInformation and Computation, 1995
- Finding level-ancestors in treesJournal of Computer and System Sciences, 1994
- Data compression with finite windowsCommunications of the ACM, 1989
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978