Abstract | ||
---|---|---|
The partial digest problem, PDP, is one of the methods used in restriction mapping to characterize a fragment of DNA. The main challenge of PDP is the exponential time for the best exact sequential algorithm in the worst case. In this paper, we reduce the running time for generating the solution of PDP by designing an efficient parallel algorithm. The algorithm is based on parallelizing the fastest sequential algorithm for PDP. The experimental study on a multicore system shows that the running time of the proposed algorithm decreases with the number of processors increases. Also, the speedup achieved good scales with increase in the number of processors. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-56154-7_10 | BIOINFORMATICS AND BIOMEDICAL ENGINEERING, IWBBIO 2017, PT II |
Keywords | Field | DocType |
Partial digest problem,Parallel algorithm,Scalability,Multicore | Computer vision,Exponential function,Parallel algorithm,Parallel computing,Artificial intelligence,Engineering,Sequential algorithm,Multi-core processor,Speedup,Scalability | Conference |
Volume | ISSN | Citations |
10209 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hazem M. Bahig | 1 | 24 | 7.61 |
Mostafa M. Abbas | 2 | 24 | 3.29 |
M. M. Mohie-Eldin | 3 | 0 | 0.68 |