Sequitur algorithm: Difference between revisions

Revision as of 19:29, 6 November 2019

Revision as of 13:42, 16 December 2020

Line 1:

'''Sequitur''' (or '''Nevill-Manning algorithm''') is a recursive algorithm developed by [[Craig Nevill-Manning]] and [[Ian H. Witten]] in 1997<ref name=Nevill-manning1997>{{cite journal

| author = [[Craig Nevill-Manning|Nevill-Manning, C.G.]]

| author-link = Craig Nevill-Manning

| author2 = Witten, I.H.

| year = 1997

Line 8 ⟶ 9:

}}</ref> that infers a hierarchical structure ([[context-free grammar]]) from a sequence of discrete symbols. The algorithm operates in linear space and time. It can be used in [[data compression]] software applications.<ref name=Nevill-manning1997_2>{{cite book

| doi = 10.1109/DCC.1997.581951

| author = [[Craig Nevill-Manning|Nevill-Manning, C.G.]]

| author-link = Craig Nevill-Manning

| title = Proceedings DCC '97. Data Compression Conference

| pages = 3–11

Line 45 ⟶ 47:

==References==

{{reflistReflist}}

==External links==