A fast exact sequential algorithm for the partial digest problem

BMC Bioinformatics

Research

Hazem M. Bahig¹  Mostafa M. Abbas² 

[1] Computer Science Division, Department of Mathematics, Faculty of Science, Ain Shams University, 11566, Cairo, Egypt;Qatar Computing Research Institute, Hamad Bin Khalifa University, Doha, Qatar;

关键词: Restriction site analysis;    Digestion process;    Partial digest problem;    DNA;    Bioinformatics algorithm;    Breadth first search;   

DOI  :  10.1186/s12859-016-1365-2

来源: Springer

【 摘 要 】

BackgroundRestriction site analysis involves determining the locations of restriction sites after the process of digestion by reconstructing their positions based on the lengths of the cut DNA. Using different reaction times with a single enzyme to cut DNA is a technique known as a partial digestion. Determining the exact locations of restriction sites following a partial digestion is challenging due to the computational time required even with the best known practical algorithm.ResultsIn this paper, we introduce an efficient algorithm to find the exact solution for the partial digest problem. The algorithm is able to find all possible solutions for the input and works by traversing the solution tree with a breadth-first search in two stages and deleting all repeated subproblems. Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. We also apply the algorithm to real data for the Luciferase gene and the E. coli K12 genome.ConclusionOur 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.

【 授权许可】

CC BY   
© The Author(s). 2016

【 图 表 】

12944_2023_1927_Article_IEq13.gif

Fig. 1

12888_2023_5256_Article_IEq1.gif

Fig. 3

12944_2023_1927_Article_IEq7.gif