作者: Tatsuya Akutsu , Hideo Bannai , Satoru Miyano , Sascha Ott
DOI: 10.1016/J.DAM.2004.10.011
关键词:
摘要: Position-specific score matrices (PSSMs) have been applied to various problems in computational molecular biology. In this paper, we study the following problem: given positive examples (sequences) and negative (sequences), find a PSSM which correctly discriminates between examples. We prove that problem is solved polynomial time if size of bounded by constant. On other hand, NP-hard not bounded. also hardness results for deriving multiple PSSMs related problems.