(untitled)

While two strings may have several longest common substrings, R. (. a. a. t. t. i. o. o. (1988). (untitled).

Type

Unclassified

Intellectual base

Unclassified

Year

1988

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Gestalt pattern matching
  • … rule and tie breaking, recursive left-right partition, matching blocks and total characters, similarity formula and bounds, complexity and behavior on reordered or repetitive text are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:f5e1382edbfd · see in the full table