Optimal Path Selection for Sequence Alignment using Hirschberg’s based Dynamic Programming Model

Sequence alignment is the technique of comparing and detecting similarities between biological molecules sequences. Sequence alignment is most beneficial in many ways in bioinformatics programs. Alignments are one of the maximum basic and vital approaches to analyze the similarity among two or more sequences. Hirschberg's algorithm is one of the methods used to align the biological molecules sequences based on dynamic programming approach. The essential application of this algorithm is to go looking most beneficial sequence alignment among two nucleotide or amino acid sequences. The primary intention of this research paper is to observe and evaluate Hirschberg’s algorithm in phrases of seek area and time complexity to obtain optimal path selection for sequence alignment with dynamic programming approach in Bioinformatics.