Refin-Align: New Refinement Algorithm For Multiple Sequence Alignment
Abstract
In this paper, we present Refin-Align a new refinement algorithm for a multiple sequence alignment. Refining alignment consists on constructing a new more accurate multiple sequence alignment from an initial one by applying some modifications. Our refinement algorithm Refin-Align uses a new definition of block and also our multiple sequence alignment algorithm Pro-malign. We assess our algorithm Refin-Align on multiple sequence alignment constructed by different algorithms using different benchmarks of protein sequences. In the most cases treated, our algorithm improves the scores of the multiple sequence alignment.References
Needleman B.S., Wunsch, D. C., (1970): “A general method applicable to the search for similarities in the amino-acid sequence of two proteins”, Journal of Molecular Biology, Vol. 48, pp443-453.
Wang, L., Jiang, T., (1994): "On the complexity of multiple
sequence alignment". J. Comput. Biol. 1, pp337-348.
Thompson, J. D., Higgins, D. G., Gibson, T. J., (1994) “CLUSTALW: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice”, Nucleid Acids Research, Vol. 22, pp 4673-4680.
Notredame, C., Heringa, J., Higgins, D., (2000) ‘T-COFFEE : A novel method for fast and accurate multiple sequence alignments’, J. Molecular Biology, pp 205-217.
Edgar, R.C. (2004) ‘MUSCLE: multiple sequence alignment with high accuracy and high throughput’, Nucleic Acids Research, Vol. 32, pp 1792-1797.
Katoh, K., Kuma, K., Toh, H., Miyata, T., (2013) ‘MAFFT version 7: Improvement in accuracy of multiple sequence alignment’, Molecular Biology and Evolution, Vol. 30, pp 772-780.
Yongtao, Y., Cheung, David, W., Wang, Yadong W., Yin, S. M., Zhang, Q., Lam, T. W., Ting, H. F., (2013) ‘GLProbs: Aligning multiple sequences adaptively’. Computational Biology and Biomedical Informatics ACM , 12(1), pp67-78.
Sievers, Fabian, Higgins, Desmond, G. (2014) ‘Clustal Omega, accurate alignment of very large numbers of sequences’, Multiple Sequence Alignment Methods, Humana Press, pp, 105-116.
Mokaddem A. Elloumi, M., (2012): ‘New distances for improving progressive alignment algorithm’, in Proc. The 2nd International Conference on Advances in Computing and Information Technology, ACITY'12 (Chennai, India), Lecture Notes in Computer Science (LNCS), Springer-Verlag, Berlin, Heidelberg, Germany (Publish.).
Kimura, M. (1983): The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge.
Sneath, P., Sokal, R., (1973) "Numerical Taxonomy", Freeman (Publish.), San Francisco:pp2 30-234.
Saitou, N., Nei, M..(1987): “The Neighbor-Joining Method: A New Method for Reconstructing Phylogenetic Trees”, Mol. Biol. Evol. Vol 4, 406-425.
Naznin, F, Sarker. R, Essam D, (2012).” Progressive Alignment Method Using Genetic Algorithm for Multiple Sequence Alignment”, IEEE Transactions on Evolutionary Computation, Vol 16.
Behera, N., Jeevitesh, M. S., Josea, J., Kant, K., Dey, A., Mazher, J., (2017) ‘Higher accuracy protein multiple sequence alignments by genetic algorithm’, Procedia Computer Science, Vol. 108, pp 1135-1144.
Thompson, J. D., Thierry, J. C., Poch, O. (2003) “RASCAL: rapid scanning and correction of multiple sequence alignments”. Bioinformatics, Vol 19, pp 1155–1161.
Chakrabarti, S., Lanczycki, C. J., Panchenko, A. R., Przytycka, T. M., Thiessen, P. A., Bryant, S. H., (2006) ‘Refining multiple sequence alignments with conserved core regions’, Nucleic Acids Res Vol. 34, pp 2598-2606.
Wallace, I.M., Blackshields, G., Higgins, D.G., “Multiple sequence alignments.” Current Opinion in Structural Biology, vol 15, pages 261–266, 2005.
Lyras, Dimitrios P., Metzler, Dirk.(2014) ‘ReformAlign: improved multiple sequence alignments using a profile-based meta-alignment approach’. BMC bioinformatics, Vol. 15, pp. 265.
Mokaddem, A.,Hadj, A. B., Elloumi, M., (2018) ‘Pro-malign: Multiple Sequence Alignment Algorithm using Approached Profile.’ Journal of software.Vol.13 No. 1, pp57-65.
Muller, T., Spang. R, Vingron. M, (2002) “Estimating amino acid substitution models: a comparison of dayhoff’s estimator, the resolvent approach and a maximum likelihood method. Mol Biol Evol, 19(1): 8-13.
Thompson, J.D., Plewniak, F., Poch, O. (1999). “BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs.” Bioinformatics. 15(1): pp87-88.
Thompson, J.D.,, Koehl P., Ripp R., Poch O.(2005)
“BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark.” PROTEINS: Structure, Function, and Bioinformatics. Vol 61:pp127–136
Raghava, G. P., Searle, S. M., Audley, P. C., Barbe,r J. D., Barton, G. J., (2003) ‘OXBENCH: a benchmark for evaluation of protein multiple sequence alignment accuracy’, BMC Bioinformatics, Vol. 4.
Barton, G.J., Sternberg, M.J.: (1987) “A strategy for the rapid multiple alignment of protein sequences, confidence levels from tertiary structure comparisons”. J Mol Biol , pp: 327–337.
Stebbings, L. A. and Mizuguchi, K., (2004) ‘HOMSTRAD: recent developments of the Homologous Protein Structure Alignment Database’, Nucleic Acids Research, Vol. 32, pp 203-207.
DOI:
https://doi.org/10.31449/inf.v43i4.2621Downloads
Published
How to Cite
Issue
Section
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.
