Sequitur algorithm: Difference between revisions

Revision as of 11:43, 25 September 2014

Revision as of 11:56, 25 September 2014

Line 5:

| title = Identifying Hierarchical Structure in Sequences: A linear-time algorithm

| arxiv = cs/9709102

}}</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 journal

| doi = 10.1109/DCC.1997.581951

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

| author2=Witten, I.H.

| year = 1997

| title = Linear-Time, Incremental Hierarchy Inference for Compression

}}</ref>.

== Constraints ==