The complexity of genome rearrangement combinatorics under the infinite sites model

DOI10.1016/j.jtbi.2020.110335zbMath1455.92096OpenAlexW3028439938WikidataQ95818260 ScholiaQ95818260MaRDI QIDQ827869

Taoyang Wu, Chris D. Greenman, Luca Penso-Dolfin

Publication date: 13 January 2021

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://ueaeprints.uea.ac.uk/id/eprint/75284/1/Manuscript3.pdf

zbMATH Keywords

combinatoricscomplexityrearrangementscancer

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Cites Work

• The combinatorics of tandem duplication
• Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes
• Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process
• Transforming cabbage into turnip
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of genome rearrangement combinatorics under the infinite sites model