Sequitur algorithm: Difference between revisions

Content deleted Content added

Revision as of 05:58, 6 July 2022 edit Citation bot (talk \| contribs) Bots 5,861,362 edits Add: s2cid. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_webform 44/3850 ← 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
(2 intermediate revisions by 2 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 54: {{Compression methods}} [[Category:Lossless compression algorithms]] [[Category:Data compression]]