On-line longest fragment first parsing algorithm Academic Article

abstract

• The central part of dictionary type data compression is the process of parsing the input string into phrases that are to be replaced with the corresponding dictionary indexes. In this article, we study the longest fragment first (LFF) parsing strategy for static dictionary compression. We present an on-line algorithm for LFF parsing that requires lookahead of length O(L 2 ), where L is the maximum length of the dictionary entries.

authors

• Lu, Mi
• Watson, Karan

published proceedings

• INFORMATION PROCESSING LETTERS

author list (cited authors)

• Nagumo, H., Lu, M., & Watson, K.

citation count

• 2

complete list of authors

• Nagumo, H||Lu, M||Watson, K

publication date

• July 1996

publisher

• Elsevier  Publisher

published in

• Information Processing Letters  Journal

keywords

• Analysis Of Algorithms
• Data Compression
• Longest Fragment First
• On-line
• Parsing
• Static Dictionary

Digital Object Identifier (DOI)

• 10.1016/0020-0190(96)00066-X

start page

• 91

end page

• 96

volume

• 59

issue

• 2

URL

• http://dx.doi.org/10.1016/0020-0190(96)00066-x