Sorting by Cuts, Joins and Whole Chromosome Duplications

DOI10.1007/978-3-319-19929-0_34zbMath1435.92041OpenAlexW1115497244MaRDI QIDQ2942277

Ron Shamir, Ron Zeira

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_34

zbMATH Keywords

computational genomicsgenome rearrangementsSCJ

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting permutations by block-interchanges
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• Sorting by Transpositions Is Difficult
• Polynomial-time algorithm for computing translocation distance between genomes

This page was built for publication: Sorting by Cuts, Joins and Whole Chromosome Duplications