SIMD Bpriori Algorithms

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Nov 2010Publisher:IEEEJournal:2010 Fourth UKSim European Symposium on Computer Modeling and Simulation

Authors: F. S. Halataei; H. Haj Seyyed Javadi;

doi: 10.1109/ems.2010.65

SIMD Bpriori Algorithms

- Summary
- Metrics

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.

Related Organizations

Tarbiat Modares University
Iran (Islamic Republic of)
Shahed University
Iran (Islamic Republic of)
Kharazmi University
Iran (Islamic Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average