Cart (Loading....) | Create Account
Close category search window
 

Pair-wise sequence alignment algorithm in bioinformatics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Chao ; Comput. Center, Changchun Inst. of Technol., Changchun, China ; Wang Fan

Bioinformatics is the core of biotechnology. Sequence alignment is the most basic and important operation of bioinformatics. The information of functions, structure and evolution in biological sequence can be found by sequence comparison. The basic operation of sequence alignment is comparison. This article describes the common kinds of pair-wise sequence alignment algorithm, and explains them in detail combined with instances. It finally points out the current problems of sequence alignment algorithm.

Published in:

Electrical & Electronics Engineering (EEESYM), 2012 IEEE Symposium on

Date of Conference:

24-27 June 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.