{"paper":{"title":"Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman","submitted_at":"2015-06-23T13:29:26Z","abstract_excerpt":"We consider the problem of finding repetitive structures and inherent patterns in a given string $\\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\\s{u}$ of a string $\\s{s}$ is both a prefix and a suffix of $\\s{s}$ such that $\\s{u} \\not= \\s{s}$. The computation of the border array of a string $\\s{s}$, namely the borders of each prefix of $\\s{s}$, is strongly related to the string matching problem: given a string $\\s{w}$, find all of its occurrences in $\\s{s}$. A {\\itshape Lyndon word} is a primitive word (i.e., it is not a power of another word) which is minimal for the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06983","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}