Talk:Sequitur algorithm: Difference between revisions

Content deleted Content added

Revision as of 19:16, 28 April 2018 edit MaxEnt (talk \| contribs) Extended confirmed users 12,492 edits →Mathematical properties: amend ← Previous edit		Latest revision as of 06:38, 9 February 2024 edit undo Cewbot (talk \| contribs) Bots 8,373,393 edits m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}. Tag: Talk banner shell conversion
(2 intermediate revisions by one other user not shown)
Line 1: {{WikiProject ~~Computing~~banner shell\|class=Start\|~~importance=}}~~ {{WikiProject Computing\|importance=}} }} ==Untitled section== Line 14 ⟶ 15: :Now I notice "linear time and space" which I guess is all that needs to be said about runtime, even though some linear algorithms are not especially fast (e.g. linear in the number of symbols processed, but non-linear in the number of distinct symbols in the alphabet). — [[user:MaxEnt\|MaxEnt]] 19:15, 28 April 2018 (UTC) == SEQUITUR == The abstract synopsis for ''Identifying Hierarchical Structure in Sequences: A linear-time algorithm'' styles the name as SEQUITUR (and not just on first use). — [[user:MaxEnt\|MaxEnt]] 19:18, 28 April 2018 (UTC)