Sorting by Cuts, Joins and Whole Chromosome Duplications

DOI10.1007/978-3-319-19929-0_34MaRDI QIDQ2942277zbMATH OpenOpenAlexFDO

Authors Ron Zeira, Ron Shamir

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)

Recommendations

• Sorting genomes by prefix double-cut-and-joins
• Genome Rearrangements and Sorting by Reversals
• Sorting genomes by generalized translocations
• Working on the problem of sorting by transpositions on genome rearrangements
• Distribution of genome rearrangement distance under double cut and join
• Whole genome duplications, multi-break rearrangements, and genome halving problem

Cites work

• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• Combinatorics of genome rearrangements.
• Introduction to algorithms
• Polynomial-time algorithm for computing translocation distance between genomes
• Sorting permutations by block-interchanges
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two

Cited in

(8)

• A linear-time algorithm for the copy number transformation problem
• The Reconstruction of Doubled Genomes
• A maximum parsimony principle for multichromosomal complex genome rearrangements
• Finding all sorting tandem duplication random loss operations
• Multiple genome rearrangement by swaps and by element duplications
• Finding All Sorting Tandem Duplication Random Loss Operations
• Linear algorithm for a cyclic graph transformation
• A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942277)