Linear-Time Text Compression by Longest-First Substitution

Author： Nakamura Ryosuke   Inenaga Shunsuke   Bannai Hideo   Funamoto Takashi   Takeda Masayuki   Shinohara Ayumi  

Publisher： MDPI

E-ISSN： 1999-4893|2|4|1429-1448

ISSN： 1999-4893

Source： Algorithms, Vol.2, Iss.4, 2009-11, pp. : 1429-1448

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

By Király Zoltán  

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 471-484

MDPI

Access to resources Recommend Favorite

From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns

By Kuo Ting  

Algorithms, Vol. 8, Iss. 2, 2015-05 ,pp. : 190-208

MDPI

Access to resources Recommend Favorite

Graph Compression by BFS

By Apostolico Alberto   Drovandi Guido  

Algorithms, Vol. 2, Iss. 3, 2009-08 ,pp. : 1031-1044

MDPI

Access to resources Recommend Favorite

Interactive Compression of Digital Data

By Carpentieri Bruno  

Algorithms, Vol. 3, Iss. 1, 2010-01 ,pp. : 63-75

MDPI

Access to resources Recommend Favorite

A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint

By Zhu Daxin   Wang Xiaodong  

Algorithms, Vol. 6, Iss. 3, 2013-08 ,pp. : 485-493

MDPI

Access to resources Recommend Favorite