MESSAGE-PASSING FOR MOTIF FINDING

被引:0
|
作者
Lee, Sang Hyun [1 ]
Vikalo, Haris [1 ]
Vishwanath, Sriram [1 ]
机构
[1] Univ Texas Austin, Dept ECE, Austin, TX 78712 USA
关键词
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A message-passing algorithm for motif finding is presented. Motif finding stands for the problem of identifying a collection of common subsequences within a given set of DNA sequences. Using a combinatorial framework for this problem, this paper describes it in terms of a graphical model. Subsequently, an inference problem is formulated over this graphical representation for the motif finding problem. The paper develops a message-passing algorithm to efficiently solve this graph-based inference problem. This algorithm serves as an efficient heuristic for solving what is otherwise a computationally intensive combinatorial optimization problem.
引用
收藏
页码:150 / 153
页数:4
相关论文
共 50 条
  • [1] FURTHER RESULTS ON MESSAGE-PASSING ALGORITHMS FOR MOTIF FINDING
    Lee, Sang Hyun
    Vikalo, Haris
    Vishwanath, Sriram
    2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, : 534 - 537
  • [2] The logic of message-passing
    Cockett, J. R. B.
    Pastro, Craig
    SCIENCE OF COMPUTER PROGRAMMING, 2009, 74 (08) : 498 - 533
  • [3] MORE ON MESSAGE-PASSING SILICON
    SCHWARTZ, DP
    COMPUTER DESIGN, 1986, 25 (06): : 18 - 18
  • [4] Combinators for Message-Passing in Haskell
    Brown, Neil C. C.
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, 2011, 6539 : 19 - 33
  • [5] msg: A message-passing library
    Roll, J
    Mandel, J
    ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS X, 2001, 238 : 233 - 236
  • [6] Informed Lifting for Message-Passing
    Kersting, Kristian
    El Massaoudi, Youssef
    Ahmadi, Babak
    Hadiji, Fabian
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 1181 - 1186
  • [7] Ordered subsets message-passing
    O'Sullivan, JA
    Singla, N
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 349 - 349
  • [8] Message-passing environments for metacomputing
    Brune, MA
    Fagg, GE
    Resch, MM
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1999, 15 (5-6): : 699 - 712
  • [9] A message-passing algorithm with damping
    Pretti, M
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2005, : 165 - 179
  • [10] Convolutional Approximate Message-Passing
    Takeuchi, Keigo
    IEEE SIGNAL PROCESSING LETTERS, 2020, 27 (27) : 416 - 420