Reconstruction of permutations distorted by single transposition errors
نویسندگان
چکیده
The reconstruction problem for permutations on n elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any n ≥ 3 an unknown permutation is uniquely reconstructible from 4 distinct permutations at transposition distance at most one from the unknown permutation. The transposition distance between two permutations is defined as the least number of transpositions needed to transform one into the other. The proposed approach is based on the investigation of structural properties of a corresponding Cayley graph. In the case of at most two transposition errors it is shown that 3 2 (n − 2)(n + 1) distinct erroneous patterns are required in order to reconstruct an unknown permutation. Similar results are obtained for two particular cases when permutations are distorted by given transpositions. These results confirm some bounds for regular graphs which are also presented in this paper.
منابع مشابه
On reconstruction of signed permutations distorted by reversal errors
The problem of reconstructing signed permutations on n elements from their erroneous patterns distorted by reversal errors is considered in this paper.A reversal is the operation of taking a segment of the signed permutation, reversing it, and flipping the signs of its elements. The reversal metric is defined as the least number of reversals transforming one signed permutation into another. It ...
متن کاملA 'Hot Potato' Gray Code for Permutations
We give the n! permutations of [n] = {1,2, . . . , n} a cyclic order inspired by the children’s game of Hot Potato. Our order is a transposition Gray code, meaning that consecutive permutations differ by a single transposition. Furthermore, each transposition is restricted in two ways: (1) It must transpose value n (the “hot potato”); (2) It must transpose positions that are circularly adjacent...
متن کاملA simple framework on sorting permutations
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange dis...
متن کاملBilateral Transposition Lip Flaps: A Novel Single-Stage Reconstruction of Central Upper Lip Defects Involving Cupid's Bow.
IMPORTANCE Defects of the central upper lip present a challenge. A variety of techniques have been described, but most tend to efface the natural contours present in the philtrum and the cutaneous-mucosal vermilion border (Cupid's bow). Furthermore, the techniques typically require a second-stage procedure to improve the upper lip aesthetic. We discuss a novel technique using bilateral transpos...
متن کاملComputational Problems in Evolution Multiple Alignment, Genome Rearrangements, and Tree Reconstruction
Reconstructing the evolutionary history of a set of species is a fundamental problem in biology. This thesis concerns computational problems that arise in different settings and stages of phylogenetic tree reconstruction, but also in other contexts. The contributions include: • A new distance-based tree reconstruction method with optimal reconstruction radius and optimal runtime complexity. Inc...
متن کامل