arXiv (All)
open access
Tunnelling with a reference
We show how to modify Baier's tunnelling for the case in which we have a non-repetitive and relatively short reference for a highly repetitive and much longer text. Given a pattern that mostly matches only one substring of the reference, we can use fairly small auxiliary data structures to speed up
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
- Simultaneous avoidance of length-4 patterns in ascent sequences#1105001
- A presuppositional account of reference fixing#735608
- A Recommendation for IPv6 Address Text Representation#213390
- Q-SPT: Learnable Query-Based Compression for Low-Frame-Rate Speech Tokenization#1156764
- Cybersecurity named entity recognition using bidirectional long short-term memory with conditional random fields#671752
Record · ID 974705
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