arXiv (All)
open access
NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance
In this paper we study the genome rearrangements done by translocation events. Genome rearrangements were used to measure evolutionary distance between organisms since 1936 (Dobzhansky and Sturtevant). The chromosomes are represented as strings of DNA and the \emph{translocation operation} is define
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
- A critical review of concepts and methods used in classical genome analysis#484884
- Minimap2: pairwise alignment for nucleotide sequences#6419
- A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction#1077783
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphs#6969
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
Record · ID 1012583
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