A novel Markov pairwise protein sequence alignment method for sequence comparison

被引:5
|
作者
Zhao, XM
Cheung, YM
Huang, DS
机构
[1] Chinese Acad Sci, Hefei Inst Intelligent Machines, Intelligent Comp Lab, Hefei 230031, Anhui, Peoples R China
[2] Univ Sci & Technol China, Dept Automat, Hefei 230026, Anhui, Peoples R China
[3] Hong Kong Baptist Univ, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
关键词
protein sequence comparison; Markov pairwise protein sequence alignment (MPPSA); Markov random filed; dynamic programming;
D O I
10.2174/0929866054696190
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
The Smith-Waterman (SW) algorithm is a typical technique for local sequence alignment in computational biology. However, the SW algorithm does not consider the local behaviours of the amino acids, which may result in loss of some useful information. Inspired by the success of Markov Edit Distance (MED) method, this paper therefore proposes a novel Markov pairwise protein sequence alignment (MPPSA) method that takes the local context dependencies into consideration. The numerical results have shown its superiority to the SW for pairwise protein sequence comparison.
引用
收藏
页码:665 / 669
页数:5
相关论文
共 50 条
  • [1] A fast method for linear space pairwise sequence alignment
    Chang, CC
    Li, YC
    Liao, CT
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2002, 2 : 257 - 264
  • [2] Research on Pairwise Sequence Alignment Needleman-Wunsch Algorithm
    Jiang, Xiantao
    Fu, Xueliang
    Dong, Gaifang
    Li, Honghui
    PROCEEDINGS OF THE 2017 5TH INTERNATIONAL CONFERENCE ON MECHATRONICS, MATERIALS, CHEMISTRY AND COMPUTER ENGINEERING (ICMMCCE 2017), 2017, 141 : 1041 - 1046
  • [3] Pairwise sequence alignment revisited - Genetic algorithms and cosine functions
    Benothman, Mohammed
    Azim, Gamil A.
    Hamdi-Cherif, Aboubekeur
    ADVANCES IN APPLIED MATHEMATICS, SYSTEMS, COMMUNICATIONS AND COMPUTERS, 2008, : 94 - +
  • [4] A study on protein sequence alignment quality
    Elofsson, A
    PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2002, 46 (03) : 330 - 339
  • [5] Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons
    Bilu, Yonatan
    Agarwal, Pankaj K.
    Kolodny, Rachel
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 3 (04) : 408 - 422
  • [6] Multiple DNA and protein sequence alignment based on segment-to-segment comparison
    Morgenstern, B
    Dress, A
    Werner, T
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (22) : 12098 - 12103
  • [7] Design and Implementation of Pairwise Sequence Alignment Algorithm Components Based on Dynamic Programming
    Shi H.
    Zhou W.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2019, 56 (09): : 1907 - 1917
  • [8] Performance evaluation of loop-structured-computer by applying pairwise sequence alignment
    Ichijo, Kenji
    Kikuchi, Nobuaki
    Yoshioka, Yoshio
    Shimizu, Toshio
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2008, 11 (03): : 351 - 362
  • [9] Pairwise sequence alignment using a PROSITE pattern-derived similarity score
    Comet, JP
    Henry, J
    COMPUTERS & CHEMISTRY, 2002, 26 (05): : 421 - 436
  • [10] A general method for fast multiple sequence alignment
    Tonges, U
    Perrey, SW
    Stoye, J
    Dress, AWM
    GENE-COMBIS, 1996, 172 : GC33 - GC41