Sequitur algorithm: Difference between revisions

Content deleted Content added

Revision as of 13:42, 16 December 2020 edit Tom.Reding (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, Template editors 4,364,437 edits m Enum 2 author/editor WLs; WP:GenFixes on Tag: AWB ← Previous edit		Latest revision as of 00:53, 6 December 2024 edit undo IznoRepeat (talk \| contribs) Extended confirmed users 50,782 edits m →External links: add WP:TEMPLATECAT to remove from template; genfixes Tag: AWB
(4 intermediate revisions by 4 users not shown)
Line 1: '''Sequitur''' (or '''Nevill-~~Manning~~Manning–Witten algorithm''') is a recursive algorithm developed by [[Craig Nevill-Manning]] and [[Ian H. Witten]] in 1997<ref name=Nevill-manning1997>{{cite journal \| author = Nevill-Manning, C.G. \| author-link = Craig Nevill-Manning Line 18: \| isbn = 978-0-8186-7761-8 \| citeseerx = 10.1.1.30.2305 \| s2cid = 14324301 }}</ref> Line 51 ⟶ 52: ==External links== * [http://www.sequitur.info/ sequitur.info – the reference Sequitur algorithm implementation in C++, Java, and other languages] {{Compression methods}} [[Category:Lossless compression algorithms]] [[Category:Data compression]]