arXiv (All)
open access
An Approximation Algorithm for Non-uniform Non-contiguous Translocation Distance
Translocations are genome rearrangement operations that exchange prefixes of two chromosomes. We study the non-uniform non-contiguous translocation distance problem, where every string produced during the computation remains available for reuse. Given an initial set of strings $A$ and a target set $
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
- Multi-ancestry colocalization approaches#389533
- Author Correction: Perspectives on ENCODE#784288
- Population-scale Ancestral Recombination Graphs with tskit 1.0#984984
- Reprogramming a Protein Ligase for Genetic Code Expansion#432716
- Programmable and Dynamic DNA Localisation at Synthetic Cell Membranes#448058
Record · ID 1051913
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