ABSTRACT
Partial Digest Problem, commonly addressed via its abbreviation “PDP,” came into existence long back in 1930, when it first appeared in the field of X-ray crystallography. PDP has many applications in computational biology, like DNA cloning, DNA sequencing , and genome cloning. The restriction site mapping is a salient application of PDP. The algorithms for PDP need to deal with different kinds of dataset possessing certain properties. With the surge in technology and its ease of use, researchers are gaining motivation to use a wide variety of tools for solving problems of computational biology. This chapter discusses two modern algorithms that have improved the running time of Skiena’s algorithm with the help of breadth first search. These algorithms provide results for Zhang data with accuracy and minimal time. The Space-Optimized Breadth First Search (BFS) Algorithm aims at optimizing the space complexity of the BFS approach.
