Abstract

Summary form only given. The suffix tree is an efficient data structure used for Ziv-Lempel coding schemes. We propose a new data structure called the k-truncated suffix tree (k-TST), which is a truncated version of the suffix tree. While the suffix tree maintains all substrings of a given string, the k-TST stores the substrings of length at most k, where k is a constant. Hence the truncated suffix tree needs less space than the suffix tree.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.