Re: Pattern matching/compression

Article View: comp.compression.research

Article #81

Back to comp.compression.research Previous Next

#81

From: Graham Toal
Date: Sun, 27 Sep 1992 23:08

9 lines
701 bytes

In article <1992Sep24.215814.3204@mksol.dseg.ti.com> kylscott@mksol.dseg.ti.com (kyl w scott) writes:
>I think I can alter the algorithms to calculate this ("next array") 
>dynamically, as it is needed, but was wondering if there already existed
>good algorithms for this type of search.

isn't this just the ubiquitous LZW?

G
--

Technical Details

Message-ID: <Bv9Eyv.J5J@ibmpcug.co.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!stl!robobar!ibmpcug!gtoal

References: <1992Sep24.215814.3204@mksol.dseg.ti.com>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!stl!robobar!ibmpcug!gtoal
From: gtoal@ibmpcug.co.uk (Graham Toal)
Newsgroups: comp.compression.research
Subject: Re: Pattern matching/compression
Message-ID: <Bv9Eyv.J5J@ibmpcug.co.uk>
Date: 27 Sep 92 23:08:55 GMT
References: <1992Sep24.215814.3204@mksol.dseg.ti.com>
Organization: The IBM PC User Group, UK.
Lines: 9

Reply to Parent Message