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

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Edited by:

Li Yuan

Pages:

2012-2015

DOI:

10.4028/www.scientific.net/AMR.403-408.2012

Citation:

K. Sharma et al., "Alignment of DNA Sequence Using the Features of Global and Local Algorithms along with Matrices", Advanced Materials Research, Vols. 403-408, pp. 2012-2015, 2012

Online since:

November 2011

Export:

Price:

$35.00

[1] Lecture6_GlobalAlignment_Notes.

[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.

[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/0022-2836(70)90057-4

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

In order to see related information, you need to Login.