Experiments in Computing Sequences of Reversals

DOI10.1007/3-540-44696-6_13MaRDI QIDQ4801151zbMATH OpenOpenAlexFDO

Authors Anne Bergeron, François Strasbourg

Publication date 6 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44696-6_13

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Recommendations

• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Sorting signed permutations by reversals, revisited
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• Combinatorial Pattern Matching

This page was built for publication: Experiments in Computing Sequences of Reversals

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