Markovian structures in biological sequence alignments

被引:50
|
作者
Liu, JS [1 ]
Neuwald, AF
Lawrence, CE
机构
[1] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[2] Cold Spring Harbor Lab, Cold Spring Harbor, NY 11724 USA
[3] New York State Dept Hlth, Wadsworth Ctr Labs & Res, Biometr Lab, Albany, NY 12201 USA
关键词
DNA sequence; evolution; Gibbs sampler; GTPase; hidden Markov model; MAP criterion; model selection; protein sequence; sequence comparisons;
D O I
10.2307/2669673
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The alignment of multiple homologous biopolymer sequences is crucial in research on protein modeling and engineering, molecular evolution, and prediction in terms of both gene function and gene product structure. In this article we provide a coherent view of the two recent models used for multiple sequence alignment-the hidden Markov model (HMM) and the block-based motif model-to develop a set of new algorithms that have both the sensitivity of the block-based model and the flexibility of the HMM. In particular, we decompose the standard HMM into two components: the insertion component, which is captured by the so-called "propagation model," and the deletion component, which is described by a deletion vector. Such a decomposition serves as a basis for rational compromise between biological specificity and model flexibility. Furthermore, we introduce a Bayesian model selection criterion that-in combination with the propagation model, genetic algorithm, and other computational aspects-forms the core of PROBE, a multiple alignment and database search methodology. The application of our method to a GTPase family of protein sequences yields an alignment that is confirmed by comparison with known tertiary structures.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 50 条
  • [41] On the fidelity of protein sequence alignments.
    Sharma, KR
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 227 : U240 - U240
  • [42] SPREADSHEET MACROS FOR COLORING SEQUENCE ALIGNMENTS
    HAYGOOD, MG
    BIOTECHNIQUES, 1993, 15 (06) : 1084 - 1089
  • [43] A scalable coprocessor for bioinformatic sequence alignments
    Smith, SF
    ESA'04 & VLSI'04, PROCEEDINGS, 2004, : 303 - 308
  • [44] Domain identification by clustering sequence alignments
    Guan, XJ
    ISMB-97 - FIFTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS FOR MOLECULAR BIOLOGY, PROCEEDINGS, 1997, : 124 - 130
  • [45] Evolving better multiple sequence alignments
    Sheneman, L
    Foster, JA
    GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2004, PT 1, PROCEEDINGS, 2004, 3102 : 449 - 460
  • [46] Evaluation measures of multiple sequence alignments
    Gonnet, GH
    Korostensky, C
    Benner, S
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2000, 7 (1-2) : 261 - 276
  • [47] Twilight zone of protein sequence alignments
    Rost, B
    PROTEIN ENGINEERING, 1999, 12 (02): : 85 - 94
  • [48] Guidelines for systematic reporting of sequence alignments
    Vihinen, Mauno
    BIOLOGY METHODS & PROTOCOLS, 2020, 5 (01):
  • [49] DATABASE OF PROTEIN-SEQUENCE ALIGNMENTS
    BARKER, WC
    GEORGE, DG
    SRINIVASARAO, GY
    YEH, LS
    FASEB JOURNAL, 1992, 6 (01): : A348 - A348
  • [50] Parallel computation for multiple sequence alignments
    Du, ZH
    Lin, F
    ICICS-PCM 2003, VOLS 1-3, PROCEEDINGS, 2003, : 300 - 303