Estimating true evolutionary distances between genomes

DOI10.1145/380752.380861zbMath1323.92143OpenAlexW2082638565MaRDI QIDQ5176022

Li-San Wang, Tandy J. Warnow

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380861

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Genetics and epigenetics (92D10)

Related Items (12)

Steps toward accurate reconstructions of phylogenies from gene-order data. ⋮ Estimating the expected reversal distance after a fixed number of reversals ⋮ The evolution of the random reversal graph ⋮ Maximum likelihood estimates of pairwise rearrangement distances ⋮ A mean first passage time genome rearrangement distance ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ TruEst: a better estimator of evolutionary distance under the INFER model ⋮ Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach ⋮ Comparing bacterial genomes from linear orders of patterns ⋮ Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? ⋮ Expected number of inversions after a sequence of random adjacent transpositions -- an exact expression

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Estimating true evolutionary distances between genomes