loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
Parallel Algorithm for Computing Reversal Distance
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
Yi-Fei She, University of Science and Technology of China
Guo-Liang Chen, University of Science and Technology of China
Computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a parallel algorithm to computing reversal distance of two signed permutations. Our algorithm consists three parts and runs in O(lg2(n)) time using O(n2) processors in SIMD-CREW model.
Index Terms:
computational biology, parallel algorithms, reversal distance, genome rearrangements, sequence comparison
Citation:
Yi-Fei She, Guo-Liang Chen, "Parallel Algorithm for Computing Reversal Distance," pdcat, pp.950-953, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.