A Comparative Study of Multiple Sequence Alignments
Keywords:
Progressive MSA, DNA, progressive alignmentAbstract
Multiple sequence alignment is a very useful tool[18]. It is used to solve different Biological sequence alignment problem like DNA and Protein sequences[3]. There are many ways to solve multiple sequence alignment problems. Dynamic programming method is used to produce MSA directly[23]. Nowadays, progressive alignment approach and iterative approach are the important methods to solve MSA problems. This paper discussion is about some progressive alignment and iterative Multiple Sequence Alignment algorithm methods and compare their performances.
References
A. Sedaghatinia, R.B. Atan R B, K.T. Arifin, Masrah, “Comparison and Evaluation of Multiple Sequence Alignment Tools In Bininformatics” ,IJCSNS International Journal of Computer Science and Network Security, Vol.9 No.7, July 2009.
U. Manzoora, S. Shahidb, B. Zafara, “A comparative analysis of multiple sequence alignments for biological data”, Pakistan. Bio-Medical Materials and Engineering 26 (2015) S1781–S1789.
T. Lassmann, E.L. Sonnhammer, “Kalign – an accurate and fast multiple sequence alignment algorithm”, BMC Bioinformatics 61-9 (2005).
H. Carillo, D. Lipman, “The multiple sequence alignment problem in biology”, SIAM Journal of Applied Mathematics, Vol 48, 1988, pp. 1073-1082.
E.V. Koonin, “Darwinian evolution in the light of genomics”, Nucleic Acids Research 37 (2009), 1011–1034
A. Layeb, M. Selmane, E.B. Elhoucine, “A new greedy randomized adaptive search procedure for multi-objective RNA structural alignment”, International Journal in Foundations of Computer Science & Technology (IJFCST)),9-24, 3 (2013.
V.K. Sohpal, A. Singh, A. Dey, “Optimization of substitution matrix for sequence alignment of major capsid proteins of human herpes simplex virus”, International Journal of BioAutomation 15 (2012), 277-284.
T. Lassmann, E.L. Sonnhammer, “Kalign – an accurate and fast multiple sequence alignment algorithm”, BMC Bioinformatics 6 (2005), 1-9.
R.M. Potter, “Constructing Phylogenetic Trees using Multiple Sequence Alignment”,University of Washington (2008).
A. Ray, B. Kartikeyan, S. Garg, “Towards Deriving an Optimal Approach for Denoising of RISAT-1 SAR Data Using Wavelet Transform” ,International Journal of Computer Sciences and Engineering journal Volume-4, Issue-10, 2016.
M. Iain, E. Wallace, “Evaluation of Iterative Algorithms for Multiple Sequence Alignment”,Bioinformatics Oxford Journal, Vol 21 No 8 2005.
Y. Chen, P. Hou, B. Manderick, “An ensemble self-training protein interaction article classifier”, Bio-Medical Materials and Engineering 24 (2014), 1323–1332.
C. Notredame,D.G. Higgins, J. Heringa, “T-Coffee: a novel method for fast and accurate multiple sequence alignment”, J Mol Biol, 302:205-217. ,2000.
Katoh K, Miyata T,Kuma K and Toh H., “Improvement in the accuracy of multiple sequence alignment program MAFFT”, Genome Informatics 16 , 22-33,2005
R.C. Edgar, “MUSCLE: multiple sequence alignment with high accuracy and high throughput”. Nucleic Acids Research, 32:1792-1797, 2004.
M. Kumar, “A Comparative Study on the Alignment Quality of Multiple Protein Sequences” J. Pharm. Sci. & Res., Vol. 7(6), 2015, 314-318.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
