Advanced lossless compression using suffix tree construction and longest common substring analysis. Exploits repetitive structure through efficient substring matching and reference-based encoding with optimal space utilization.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Suffix Structure |
| Security status | 🎓 Educational Only |
| Complexity | Expert |
| Inventor | Edward McCreight, Esko Ukkonen |
| Year | 1976 |
| Origin | 🇺🇸 United States |
| Source | algorithms/compression/suffix-tree.js |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
3 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty input
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000 |
Vector 2 — Repetitive pattern - optimal for suffix tree
| Field | Value |
|---|---|
input |
616261626162 |
expected |
06000000000261620402000000 |
Vector 3 — Classic suffix tree example
| Field | Value |
|---|---|
input |
62616e616e61 |
expected |
06000000000362616e0302000000 |