Publications

Abstract : Dynamic programming in bioinformatics is a memory based data structure for saving computational time with one-time storage of each problem solution. Algorithm and Scoring parameters are used to evaluate Brainstem Glioma patients DNA Sequence and comparing each other. 1. Local comparison a. Ignoring disparate sequences outside similar sequences b. locally arrange similar sequence. 2. Global comparison. Building evolutionary tree of sequences with functional comparison each other. The calculating functional similarity of related sequence is more important than unrelated sequence comparison. Implemented Hybrid approach provides operations with more than 1000000 nucleotides using divide and conquers approach i.e. multi branched recursion. Filling only main three diagonals lead to get an optimal solution with the accurate result comparing other existing approaches.