Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss

DOI10.1016/J.AAM.2024.102757MaRDI QIDQ6616297

Peter F. Stadler, Bruno J. Schmidt, Tom Hartmann

Publication date: 9 October 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

efficient algorithmsgenome rearrangementspermutation sorting problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Genetics and epigenetics (92D10) Software, source code, etc. for problems pertaining to biology (92-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding all sorting tandem duplication random loss operations
• The combinatorics of biased riffle shuffles
• A very elementary presentation of the Hannenhalli-Pevzner theory
• Sorting by Transpositions Is Difficult
• Transforming cabbage into turnip
• On the tandem duplication-random loss model of genome rearrangement
• Shuffling Cards and Stopping Times
• On the Exact Complexity of String Matching: Upper Bounds
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Combinatorics of Permutations

This page was built for publication: Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss

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