Diagonal Consistency Problem Resolution in DIALIGN Algorithm

Ibrahim Chegrane, Athman Sighier, Chahrazed Ighilaza, Aicha Boutorh

2015

Abstract

DIALIGN is a well known Algorithm for pairwise as well as multiple alignment of nucleic acid and protein sequences. It combines local and global alignment features. In this paper we present a new method to better solve the problem of diagonals consistency in DIALIGN algorithm using graph theory modeling. and we describe a new implementation of the method from the extraction of diagonals to the final alignment process. We show the power of our proposed aproach by comparing it with DIALIGN 2.2 using benchmarks from ”BAliBASE” and ”SMART” databases.

References

  1. Abdeddam, S. (1997). On incremental computation of transitive closure and greedy alignment. In Apostolico, A. and Hein, J., editors, Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 167-179. Springer Berlin Heidelberg.
  2. Bondy, J. and Murty, U. (1976). Graph Theory with Applications. Macmillan.
  3. Cormen, T., Leiserson, C., Rivest, R., and Stein, C. (2001). Depth-first search. In Introduction To Algorithms, chapter 22, pages 540-549. MIT Press.
  4. Derrien, V., Richer, J.-M., and Hao, J.-K. (2005). Plasma, un nouvel algorithme progressif pour l'alignement multiple de séquences. In Solnon, C., editor, Premières Journées Francophones de Programmation par Contraintes, pages 39-48, Lens. CRIL - CNRS FRE 2499, Université d'Artois. http://www710.univlyon1.fr/c˜solnon.
  5. Edgar, R. C. (2004). Muscle: multiple sequence alignment with high accuracy and high throughput. Nucleic acids research, 32(5):1792-1797.
  6. Kim, C. and Lee, B. (2005). Improved probability calculation for dialign2.
  7. Morgenstern, B. (1999). Dialign 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15(3):211-218.
  8. Morgenstern, B., Atchley, W., Hahn, K., and Dress, A. (1998a). Segment-based scores for pairwise and multiple sequence alignments. Ismb.
  9. Morgenstern, B., Frech, K., Dress, A., and Werner, T. (1998b). Dialign: finding local similarities by multiple sequence alignment. Bioinformatics, 14(3):290- 294.
  10. Morgenstren, B., Dress, A., and Werner, T. (1996). Multiple DNA and protein sequence alignment based on segment-to-segment comparison. 93(October):12098-12103.
  11. Needleman, S. B. and Wunsch, C. D. (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3):443 - 453.
  12. Notredame, C., Higgins, D. G., and Heringa, J. (2000). Tcoffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology, 302(1):205 - 217.
  13. Smith, T. and Waterman, M. (1981). Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195 - 197.
  14. Subramanian, A. R., Kaufmann, M., and Morgenstern, B. (2008). DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms for molecular biology : AMB, 3:6.
  15. Subramanian, A. R., Weyer-Menkhoff, J., Kaufmann, M., and Morgenstern, B. (2005). DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. BMC bioinformatics, 6:66.
  16. Thompson, J. D., Higgins, D. G., and Gibson, T. J. (1994). Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research, 22(22):4673- 4680.
Download


Paper Citation


in Harvard Style

Chegrane I., Sighier A., Ighilaza C. and Boutorh A. (2015). Diagonal Consistency Problem Resolution in DIALIGN Algorithm . In Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2015) ISBN 978-989-758-070-3, pages 225-231. DOI: 10.5220/0005284802250231


in Bibtex Style

@conference{bioinformatics15,
author={Ibrahim Chegrane and Athman Sighier and Chahrazed Ighilaza and Aicha Boutorh},
title={Diagonal Consistency Problem Resolution in DIALIGN Algorithm},
booktitle={Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2015)},
year={2015},
pages={225-231},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005284802250231},
isbn={978-989-758-070-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms - Volume 1: BIOINFORMATICS, (BIOSTEC 2015)
TI - Diagonal Consistency Problem Resolution in DIALIGN Algorithm
SN - 978-989-758-070-3
AU - Chegrane I.
AU - Sighier A.
AU - Ighilaza C.
AU - Boutorh A.
PY - 2015
SP - 225
EP - 231
DO - 10.5220/0005284802250231