Title :
SIMD Bpriori Algorithms
Author :
Halataei, F.S. ; Javadi, H. Haj Seyyed
Author_Institution :
Math. Sci., Tarbiat Modares Univ., Tehran, Iran
Abstract :
Finding meaningful patterns is one of the most investigated fields of computational biology. Generalized Center String (GCS) problem is one of the problems that were established and Bpriori Algorithms have been proposed to solve GCS. In this paper we present parallel Bpriori Algorithms based on existing approaches. These algorithms are SIMD on Cube-Connected network, where the size of alphabet set is two. We consider these algorithms theoretically. Also, time complexity is estimated based on probabilistic analysis.
Keywords :
biocomputing; computational complexity; hypercube networks; parallel algorithms; probability; GCS problem; SIMD Bpriori algorithm; computational biology; cube-connected network; generalized center string; parallel Bpriori algorithm; probabilistic analysis; time complexity; Bpriori Algorithm; Cube-Connected network; GCS Problem; SIMD;
Conference_Titel :
Computer Modeling and Simulation (EMS), 2010 Fourth UKSim European Symposium on
Conference_Location :
Pisa
Print_ISBN :
978-1-4244-9313-5
Electronic_ISBN :
978-0-7695-4308-6
DOI :
10.1109/EMS.2010.65
