PubMed Central
metadata only
CC BY 4.0
A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmers
Skiplists (Pugh, 1990) are probabilistic data structures over ordered lists supporting 𝒪(log N) insertion and search, which share many properties with balanced binary trees. Previously we introduced the graph Burrows-Wheeler transform (GBWT) to support efficient search over pangenome path sets, but
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
- Evolutionary Retention and Lineage-Specific Expansion of Whole-Genome-Duplication-Derived Gene Families in Cyprinid Fishes#684736
- Determining Coding CpG Islands by Identifying Regions Significant for Pattern Statistics on Markov Chains#779332
- Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation#1063381
- Allelic coverage analyses reveal a high proportion and uneven chromosomal distribution of SNPs associated with polymorphic duplications in the oyster Ostrea edulis#1136690
- Double Eulerian cycles on de Bruijn digraphs#1361677
Record · ID 1252739
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