A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
نویسندگان
چکیده
منابع مشابه
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to distance calculation) proceeds in two stages: in the first stage, the overlap graph induced by the pe...
متن کاملA Linear-Time Algorithm for Computing Inversion Distance between Signed Permuta
Hannenhalli and Pevzner gave the rst polynomial-time algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to distance calculation) proceeds in two stages: in the rst stage, the overlap graph induced by the permut...
متن کاملA General Algorithm for Computing Distance Transforms in Linear Time
A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorith...
متن کاملA Unified Linear-Time Algorithm for Computing Distance Maps
Distance maps of binary images contain. for each pixel, the distance between that pixel and the pixel of value 0 closest to it. They have important uses in computer vision, pattern recognition, morphology and robotics ( IO]. Many algorithms have been proposed for computing distance maps for a variety of distances such as the Li, L,, octagonal and Euclidean distances ]%I I-131. Recently, Kolounz...
متن کاملComputing signed permutations of polygons
Given a planar polygon (or chain) with a list of edges {e1, e2, e3, . . . , en−1, en}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider are: reversals which involve inverting the order of a sublist, transpositions which involve interchanging subchains (sublists), and edge-swaps which are a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2001
ISSN: 1066-5277,1557-8666
DOI: 10.1089/106652701753216503