Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach
From MaRDI portal
Publication:1736946
DOI10.1007/s11538-018-0511-6zbMath1410.92068OpenAlexW2893298367WikidataQ60692046 ScholiaQ60692046MaRDI QIDQ1736946
Venta Terauds, Jeremy G. Sumner
Publication date: 26 March 2019
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-018-0511-6
Related Items (4)
A new algebraic approach to genome rearrangement models ⋮ A mean first passage time genome rearrangement distance ⋮ Rearrangement events on circular genomes ⋮ Bacterial phylogeny in the Cayley graph
Uses Software
Cites Work
- An algebraic view of bacterial genome evolution
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- Estimating the expected reversal distance after a fixed number of reversals
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Maximum likelihood estimates of pairwise rearrangement distances
- Group-theoretic models of the inversion process in bacterial genomes
- Transforming cabbage into turnip
- On the Enumeration of Polygons
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
- Estimating true evolutionary distances between genomes
- A representation-theoretic approach to the calculation of evolutionary distance in bacteria
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach