Name
Abstract | ||
|---|---|---|
Our algorithm is a fast tool to find the exact solution for the partial digest problem. The percentage of improvement is more than 75% over the best known practical algorithm for the worst case. For large numbers of inputs, our algorithm is able to solve the problem in a suitable time, while the best known practical algorithm is unable. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1186/s12859-016-1365-2 | BMC Bioinformatics |
Keywords | Field | DocType |
Bioinformatics algorithm,Breadth first search,DNA,Digestion process,Partial digest problem,Restriction site analysis | Computer science,Breadth-first search,Algorithm,DNA,Bioinformatics,Sequential algorithm,Restriction site,DNA microarray | Journal |
Volume | Issue | ISSN |
17 | S-19 | 1471-2105 |
Citations | PageRank | References |
1 | 0.35 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mostafa M. Abbas | 1 | 24 | 3.29 |
| Hazem M. Bahig | 2 | 24 | 7.61 |