Estimate the distance of genome rearrangements by reversals

DOI10.1007/S10910-006-9095-8zbMATH Open1122.92046OpenAlexW2083305503MaRDI QIDQ2385374FDOQ2385374

Authors: Jianxiu Hao 

Publication date: 12 October 2007

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9095-8

Recommendations

• Genome Rearrangements and Sorting by Reversals
• Publication:4886097
• Sorting by Transpositions
• scientific article; zbMATH DE number 1263193
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Cites Work

• Graph theory with applications
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals

Cited In (7)

• Comparative Genomics
• Maximum likelihood estimates of pairwise rearrangement distances
• Estimation of genome length
• A new approach for the reversal distance with indels and moves in intergenic regions
• Chloroplast gene order and the divergence of plants and algae, from the normalized number of induced breakpoints
• Placing Probes along the Genome Using Pairwise Distance Data
• Title not available (Why is that?)

This page was built for publication: Estimate the distance of genome rearrangements by reversals

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