Reproduce “Counting approximate breakpoint medians of random genomes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Poly H. da Silva, Arash Jamshidpey, David Sankoff
The authors count ordered tuples of independent uniform input genomes for which a fixed permutation is a c-approximate breakpoint median, using a local test of how many candidate adjacencies are absent from every input. At n=28, k=3, and c=2, the probability is 7.11×10⁻¹⁶, while the expected count is about 2.17×10¹⁴; exact medians receive upper bounds, not exact counts.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.