2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05) A generic algorithm to find all common intervals of two permutations Stanford, California August 08-August 11 ISBN: 0-7695-2442-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSBW.2005.9
Let N be the set of {1, 2, , ...,m}, [x, y] denote the set of [x, x + 1, ..., y], where 1 \leqslant x,y \leqslant m. Given two permutations sA and sB of a set N, A 2-tuple of intervals ([x_1 ,y_1 ],[x_2 ,y_2 ]) is called common intervals if \sigma _A ([x_1, y_1]) = \sigma _A([x_2, y_2]). In this paper, we propose a sufficient and necessary condition for a 2-tuple of intervals to be common intervals. Based on these conditions, we present a generic algorithm that finds all common intervals of these two permutations.
Citation:
Guiliang Feng, Yujiang Shan, "A generic algorithm to find all common intervals of two permutations," csbw, pp.85-88, 2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb