Alignment of DNA Sequence Using the Features of Global and Local Algorithms along with Matrices

Article Preview

Abstract:

The algorithm generated is based on designing matrices in such a way that score matrix contains the maximum scores for alignment of the DNA sequences and the aligned sequences are generated by trace matrix generated based on the score matrix. The score matrix is initialized by using Smith – Waterman algorithm and the scores used for filling up the score matrix are calculated using Needleman –Wunsch algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2012-2015

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lecture6_GlobalAlignment_Notes.

Google Scholar

[2] Likić V (2008) the Needleman- Wunsch algorithm for sequence alignment. Lecture given at the 7th Melbourne Bioinformatics Course, Bio21 Molecular Science and Biotechnology Institute, University of Melbourne.

Google Scholar

[3] Needleman S and Wunsch C (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins,. Journal of Molecular Biology.

DOI: 10.1016/b978-0-12-131200-8.50031-9

Google Scholar

[4] The Needleman-Wunsch algor i thm for sequence alignment 7th Melbourne BioinformaticsCourse.

Google Scholar