A polyhedral approach to RNA sequence structure alignment

被引:31
作者
Lenhof, HP
Reinert, K [1 ]
Vingron, M
机构
[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
[2] Deutsch Krebsforschungszentrum, Abt Theoret Bioinformat, D-69120 Heidelberg, Germany
关键词
D O I
10.1089/cmb.1998.5.517
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U, It generally is a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA molecules it is important to consider both the base sequence and the structure of the molecules. Traditional alignment algorithms can only account for the sequence of bases, but not for the base pairings. Considering the structure leads to significant computational problems because of the dependencies introduced by the base pairings, In this paper we address the problem of optimally aligning a given RNA sequence of unknown structure to one of known sequence and structure. We phrase the problem as an integer linear program and then solve it using methods from polyhedral combinatorics. In our computational experiments we could solve large problem instances-23S ribosomal RNA with more than 1400 bases-a size intractable for former algorithms.
引用
收藏
页码:517 / 530
页数:14
相关论文
共 16 条
[11]  
NEMHAUSER G, 1973, MATH PROGRAM, V6, P48
[12]  
Nemhauser GL, 1988, INTEGER COMBINATORIA
[13]  
REINERT K, 1997, P 1 ANN INT C COMP M, P241
[15]  
Tsukiyama S., 1977, SIAM Journal on Computing, V6, P505, DOI 10.1137/0206036
[16]  
Waterman M.S., 1989, MATH METHODS DNA SEQ, P185