NORMALIZATION OF AFFINE GAP COSTS USED IN OPTIMAL SEQUENCE ALIGNMENT

被引：9

作者：

ALLISON, L

机构：

[1] Department of Computer Science, Monash University

来源：

JOURNAL OF THEORETICAL BIOLOGY | 1993年 / 161卷 / 02期

关键词：

D O I：

10.1006/jtbi.1993.1054

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

It is shown how to normalize the costs of an alignment algorithm that employs affine or linear gap costs. The normalized costs are interpreted as the -log probabilities of the instructions of a finite-state edit-machine. This gives an explicit model relating sequences that can be linked to processes of mutation and evolution. © 1993 Academic Press Limited.

引用

收藏

页码：263 / 269

页数：7

相关论文

共 18 条

[1] FINITE-STATE MODELS IN THE ALIGNMENT OF MACROMOLECULES [J].

ALLISON, L ;

WALLACE, CS ;

YEE, CN .

JOURNAL OF MOLECULAR EVOLUTION, 1992, 35 (01) :77-89

[2]

ALLISON L, 1992, 25TH HAW INT C SYS S, V1, P663

[3] GAP COSTS FOR MULTIPLE SEQUENCE ALIGNMENT [J].

ALTSCHUL, SF .

JOURNAL OF THEORETICAL BIOLOGY, 1989, 138 (03) :297-309

[4]

ALTSCHUL SF, 1986, B MATH BIOL, V48, P603, DOI 10.1016/S0092-8240(86)90010-8

[5] MAXIMUM-LIKELIHOOD ALIGNMENT OF DNA-SEQUENCES [J].

BISHOP, MJ ;

THOMPSON, EA .

JOURNAL OF MOLECULAR BIOLOGY, 1986, 190 (02) :159-165

[6]

Dayhoff MO., 1978, ATLAS PROTEIN SEQ ST, V5, P345

[7] EXHAUSTIVE MATCHING OF THE ENTIRE PROTEIN-SEQUENCE DATABASE [J].

GONNET, GH ;

COHEN, MA ;

BENNER, SA .

SCIENCE, 1992, 256 (5062) :1443-1445

[8] AN IMPROVED ALGORITHM FOR MATCHING BIOLOGICAL SEQUENCES [J].

GOTOH, O .

JOURNAL OF MOLECULAR BIOLOGY, 1982, 162 (03) :705-708

[9] THE RAPID GENERATION OF MUTATION DATA MATRICES FROM PROTEIN SEQUENCES [J].

JONES, DT ;

TAYLOR, WR ;

THORNTON, JM .

COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1992, 8 (03) :275-282

[10] SEQUENCE COMPARISON WITH CONCAVE WEIGHTING FUNCTIONS [J].

MILLER, W ;

MYERS, EW .

BULLETIN OF MATHEMATICAL BIOLOGY, 1988, 50 (02) :97-120