scientific article; zbMATH DE number 871927

MaRDI QIDQ4875199zbMATH OpenFDO

Authors Sridhar Hannenhalli, Pavel Pevzner

Publication date 28 April 1996

zbMATH Keywords

singletonssorting permutation by reversals

Mathematics Subject Classification ID

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

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

Cited in

(12)

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

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)