Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13895
Title: A sequential iterative refinement optimization method to multiple sequence alignment
Authors: LI YIHUI
Keywords: Multiple Sequence Alignment Iterative Algorithm Score
Issue Date: 4-May-2004
Source: LI YIHUI (2004-05-04). A sequential iterative refinement optimization method to multiple sequence alignment. ScholarBank@NUS Repository.
Abstract: The multiple sequence alignment of protein sequences or DNA sequences has become one of the most important tools in the modern molecular biology. In order to do the fast and efficient multiple sequence alignment analysis, a lot of methods and programs such as dynamic programming, progressive and iterative approaches, have been developed. This thesis introduced a a??Sequential Iterative Refinement Optimization Algorithm (SIROA)a?? approach. The basic procedure of the SIROA is a heuristic progressive approach; however, we do the iterative refinement optimization for the sub-aligned sequences group in each step of the progressive alignment. This iterative process increases the sensitivity of the traditional progressive alignment method and corrects the possible early made mistakes. In order to reduce the additional computational complexity from the iterative procedures, we partition the sequence set into some blocks before the progressive alignment. Numerical multiple sequence alignment results reference to BAliBASE database have been done for evaluating the SIROA method and comparing it with other approaches.
URI: http://scholarbank.nus.edu.sg/handle/10635/13895
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
HT016998H_Thesis.pdf495.29 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

289
checked on Jan 22, 2018

Download(s)

810
checked on Jan 22, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.