Abstract
Sequence alignment is the most basic operation in computational biology and bioinformatics. It serves as a basic for many other more complex manipulations. It is the first and most important step of homology modeling, which is based on structural similarity. However, structural similarity of two sequences is dependent on the percentage of sequence identity and number of residues aligned which is achieved by sequence alignment. In this paper, we implemented the two routes for sequence comparison, that is; the dotplot and Needleman-wunsch algorithm for global sequence alignment. Our algorithms were implemented in python programming language and were tested on Linux platform 1.60GHz, 512 MB of RAM SUSE 9.2 and 10.1 versions. International Journal of Natural and Applied Sciences Vol. 2 (4) 2006: pp. 300-304
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Natural and Applied Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
