Experiments in Computing Sequences of Reversals

DOI10.1007/3-540-44696-6_13zbMATH Open1018.68871OpenAlexW1588532374MaRDI QIDQ4801151FDOQ4801151

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

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

Mathematics Subject Classification ID

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

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)