Sorting by Cuts, Joins and Whole Chromosome Duplications
From MaRDI portal
Publication:2942277
DOI10.1007/978-3-319-19929-0_34zbMATH Open1435.92041OpenAlexW1115497244MaRDI QIDQ2942277FDOQ2942277
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
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
- Introduction to algorithms
- Combinatorics of genome rearrangements.
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Polynomial-time algorithm for computing translocation distance between genomes
- Title not available (Why is that?)
- Sorting permutations by block-interchanges
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)
