TY - GEN
T1 - Message-passing for motif finding
AU - Lee, Sang Hyun
AU - Vikalo, Haris
AU - Vishwanath, Sriram
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70349485089&partnerID=8YFLogxK
U2 - 10.1109/GENSIPS.2009.5174332
DO - 10.1109/GENSIPS.2009.5174332
M3 - Conference contribution
AN - SCOPUS:70349485089
SN - 9781424447619
T3 - 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS 2009
BT - 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS 2009
T2 - 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS 2009
Y2 - 17 May 2009 through 21 May 2009
ER -