arXiv (All)
open access
Move-rb: Faster Bi-Directional r-indexes and Approximate Pattern Matching
Approximate pattern matching (APM) on highly repetitive texts is a central task in bioinformatics. Bi-directional r-indexes support left- and right-extension of a pattern and thereby accelerate APM algorithms based on search schemes, but existing variants -- br-index and b-move -- suffer from two bo
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
- Repeats mimic pathogen-associated patterns across a vast evolutionary landscape#68257
- PUMA: Learning a Mutation-Aware Vocabulary of Protein Units#1156174
- PUFFER: Incremental Fuzzy Deduplication for Continuously Evolving Corpora#792873
- PUFFER: Incremental Fuzzy Deduplication for Continuously Evolving Corpora#788869
- Low-Latency Spell Correction for Japanese Music Search Queries#927562
Record · ID 1078160
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