When comparing two sequences to identify similarities and differences between them, generally, a measure of how similar they are is also desirable. Similar sequences probably have the same ancestor, share the same structure, and have a similar biological function. A typical approach to solve this problem is to find a good and reasonable alignment between the two sequences. Then, given an appropriate scoring scheme, their similarity can be computed. This study describes the concepts, tools and implementation of selected algorithms being used for sequence analysis.

1. [<ol> Text available (online): http://en.wikipedia.org/wiki/ sequence_ analysis Image available (online): http://www.apimba.org.php Hassan Mathkour and Muneer Ahmad, Genome Sequence Analysis, A Survey, Journal of Computer Science. Maxime Crochemore, Sequence Alignment Algorithms, Kings College, London Krishna Bikram Shah and Samarjeet Borah, “Protein Sequence Aaalysis, A Study on Recent Developement”, ISBN 978-1-4244-9241-1, IEEE CPF1197F-PRT, Pg. 506-510 Text available (online) http://www.wekipedia.com. Zhinua Du and Feng Lin, Improvement of the Needleman-Wunsch Algorithm, 2004, Volume 3066/2004, 792-797 Smith TF and Waterman MS, Identification of Common Molecular Subsequences, J. Mol. Biol. (1981) 147, 195-197 Text available (online): www.ebi.ac.uk/fasta33 Text available (online): www.ncbi.nlm.nih.gov/BLAST Result from http://www.ebi.ac.uk/Tools/emboss/align/ </ol>]

Genome DNA adenosine cytosine guanine thymine