SEQUENCE SIMILARITY (HOMOLOGY) SEARCHING FOR MOLECULAR BIOLOGISTS

作     者：DAVISON, D 

作者机构：SUNY STONY BROOK GRAD PROGRAM GENET STONY BROOK NY 11794 USA 

出 版 物：《BULLETIN OF MATHEMATICAL BIOLOGY》 (数理生物学通报)

年 卷 期：1985年第47卷第4期

页      面：437-474页

核心收录：

学科分类：0710[理学-生物学] 07[理学] 09[农学] 

基　　金：NIGMS NIH HHS [GM32003] Funding Source: Medline PHS HHS [5T32G07964] Funding Source: Medline 

主　　题：Alignment Program Global Alignment Optimal Alignment Alignment Procedure Direct Repeat Sequence 

摘      要：Major types of sequence similarity searching (often, and incorretly, called homology searching) are reviewed and examples of each are presented. The features and limitations of each type of program, and individual implementations of each type are discussed. Two pairs of sequences are used as examples to show how implementations of each type differ in their results and their presentation. Both local and global alignment programs are examined, and the programs reviewed run on many different types of computer architectures, from laboratory computers such as the IBM PC, minicomputers such as the VAX, to large mainframe computers such as DEC-10/20 series.