International Journal of Bioinformatics Research and Applications · 2010 · 16 citations · 0 references
Life SciencesBioinformaticsMolecular BiologyComputational BiologyMolecular EvolutionSequence AnalysisDynamic Programming For AlignmentSequence AlignmentDynamic ParallelismMultiple Sequence AlignmentNeedleman-wunsch AlgorithmProtein Sequence AlignmentSmith - Waterman Algorithm
Multiple alignment of protein sequences helps to determine evolutionary linkage and to predict molecular structures. The factors to be considered while aligning multiple sequences are speed and accuracy of alignment. Although dynamic programming algorithms produce accurate alignments, they are computation intensive. In this paper we propose a time efficient approach to sequence alignment that also produces quality alignment. The dynamic nature of the algorithm coupled with data and computational parallelism of hadoop data grids improves the accuracy and speed of sequence alignment. The principle of block splitting in hadoop coupled with its scalability facilitates alignment of very large sequences.