Bielefeld Pub
metadata only
An incomplex algorithm for fast suffix array construction
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
- Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform#312105
- Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation#1063381
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- Compressed suffix tree - a basis for genome-scale sequence analysis#492630
- Rotation-Optimal Noncommutative Prefix Scans in Bit-Reversed Homomorphic Layouts#343405
Record · ID 492663
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