arXiv (All)
open access
Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
68q32data-structures-and-algorithmsf-2-2formal-languages-and-automata-theoryg-2-1i-2-6machine-learning
We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular stringological complexity measures of the sequence. In this work (the first in a series) we focus on two such measures:
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
- A Sequence Sensitive Model of Encoding Precision#313355
- Sequence to Sequence Learning with Neural Networks#6462
- PairAlign: A Framework for Sequence Tokenization via Self-Alignment with Applications to Audio Tokenization#168328
- Linguistic Distance Segregates Latent Representations in Automatic Speech Recognition Systems#622540
- Aligned Birding Sequences Without Stop Codons#261792
Record · ID 1116238
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