title: Sequence alignment with an appropriate substitution matrix.
abstract: A widely used algorithm for computing an optimal local alignment between two sequences requires a parameter set with a substitution matrix and gap penalties. It is recognized that a proper parameter set should be selected to suit the level of conservation between sequences. We describe an algorithm for selecting an appropriate substitution matrix at given gap penalties for computing an optimal local alignment between two sequences. In the algorithm, a substitution matrix that leads to the maximum alignment similarity score is selected among substitution matrices at various evolutionary distances. The evolutionary distance of the selected substitution matrix is defined as the distance of the computed alignment. To show the effects of gap penalties on alignments and their distances and help select appropriate gap penalties, alignments and their distances are computed at various gap penalties. The algorithm has been implemented as a computer program named SimDist. The SimDist program was compared with an existing local alignment program named SIM for finding reciprocally best-matching pairs (RBPs) of sequences in each of 100 protein families, where RBPs are commonly used as an operational definition of orthologous sequences. SimDist produced more accurate results than SIM on 50 of the 100 families, whereas both programs produced the same results on the other 50 families. SimDist was also used to compare three types of substitution matrices in scoring 444,461 pairs of homologous sequences from the 100 families.
authors.affiliation: Department of Computer Science, Iowa State University, Ames, Iowa 50011-1040, USA. xqhuang@cs.iastate.edu
authors.forename: Xiaoqiu
authors.initials: X
authors.lastname: Huang
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D019143:Evolution, Molecular; D011506:Proteins / Q000235:genetics; D016415:Sequence Alignment; D012984:Software
chemical_list: D011506:Proteins