scientific article; zbMATH DE number 871927

zbMATH Open0852.68119MaRDI QIDQ4875199FDOQ4875199

Authors: Sridhar Hannenhalli, Pavel Pevzner 

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

singletonssorting permutation by reversals

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Combinatorics in computer science (68R05) Searching and sorting (68P10)

Cited In (12)

• Sorting by multi-cut rearrangements
• Invertibility of Digraphs and Tournaments
• Kernelization of Whitney Switches
• On the complexity of unsigned translocation distance
• Genome rearrangements with partially ordered chromosomes
• Title not available (Why is that?)
• Sorting genomes by prefix double-cut-and-joins
• Sorting by reversals and the theory of 4-regular graphs
• Kernelization of Whitney switches
• Polynomial-time sortable stacks of burnt pancakes
• On sorting unsigned permutations by double-cut-and-joins
• Plane permutations and applications to a result of Zagier-Stanley and distances of permutations

This page was built for publication:

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