On the complexity of deriving position specific score matrices from positive and negative sequences

Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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 examples (sequences), find a PSSM which correctly discriminates between positive and negative examples. We prove that this problem is solved in polynomial time if the size of a PSSM is bounded by a constant. On the other hand, we prove that this problem is NP-hard if the size is not bounded. We also prove hardness results for deriving multiple PSSMs and related problems.

Original languageEnglish
Pages (from-to)676-685
Number of pages10
JournalDiscrete Applied Mathematics
Volume155
Issue number6-7
DOIs
Publication statusPublished - Apr 1 2007
Externally publishedYes

Fingerprint

Molecular biology
Computational Molecular Biology
Computational complexity
Hardness
Polynomials
Polynomial time
NP-complete problem

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

On the complexity of deriving position specific score matrices from positive and negative sequences. / Akutsu, Tatsuya; Bannai, Hideo; Miyano, Satoru; Ott, Sascha.

In: Discrete Applied Mathematics, Vol. 155, No. 6-7, 01.04.2007, p. 676-685.

Research output: Contribution to journalArticle

Akutsu, Tatsuya ; Bannai, Hideo ; Miyano, Satoru ; Ott, Sascha. / On the complexity of deriving position specific score matrices from positive and negative sequences. In: Discrete Applied Mathematics. 2007 ; Vol. 155, No. 6-7. pp. 676-685.
@article{48a20e4fffb0407d8ebb06e6a4f8d2b5,
title = "On the complexity of deriving position specific score matrices from positive and negative sequences",
abstract = "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 examples (sequences), find a PSSM which correctly discriminates between positive and negative examples. We prove that this problem is solved in polynomial time if the size of a PSSM is bounded by a constant. On the other hand, we prove that this problem is NP-hard if the size is not bounded. We also prove hardness results for deriving multiple PSSMs and related problems.",
author = "Tatsuya Akutsu and Hideo Bannai and Satoru Miyano and Sascha Ott",
year = "2007",
month = "4",
day = "1",
doi = "10.1016/j.dam.2004.10.011",
language = "English",
volume = "155",
pages = "676--685",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "6-7",

}

TY - JOUR

T1 - On the complexity of deriving position specific score matrices from positive and negative sequences

AU - Akutsu, Tatsuya

AU - Bannai, Hideo

AU - Miyano, Satoru

AU - Ott, Sascha

PY - 2007/4/1

Y1 - 2007/4/1

N2 - 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 examples (sequences), find a PSSM which correctly discriminates between positive and negative examples. We prove that this problem is solved in polynomial time if the size of a PSSM is bounded by a constant. On the other hand, we prove that this problem is NP-hard if the size is not bounded. We also prove hardness results for deriving multiple PSSMs and related problems.

AB - 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 examples (sequences), find a PSSM which correctly discriminates between positive and negative examples. We prove that this problem is solved in polynomial time if the size of a PSSM is bounded by a constant. On the other hand, we prove that this problem is NP-hard if the size is not bounded. We also prove hardness results for deriving multiple PSSMs and related problems.

UR - http://www.scopus.com/inward/record.url?scp=33846889735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846889735&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2004.10.011

DO - 10.1016/j.dam.2004.10.011

M3 - Article

VL - 155

SP - 676

EP - 685

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 6-7

ER -