arXiv (All)
open access
Algorithms for Computing Longest Unbordered Factors on Run-Length Encoded Strings
A border of a string is a non-empty proper prefix of the string that is also a suffix. A string is called unbordered if it has no border. The longest unbordered factor is a fundamental notion in stringology, closely related to string periodicity. This paper addresses the longest unbordered factor pr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Representing Information on DNA using Patterns Induced by Enzymatic Labeling#1388737
- ZMUT DNA barcoded Collembola#445685
- Linear codes over a mixed-alphabet ring and their Gray images with applications to projective and locally repairable codes#1297008
- GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates#1236183
- 15 U.S.C. § 6910 — Implementation#565649
Record · ID 1402949
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive