On the complexity of deriving position specific score matrices from examples

Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

PSSMs (Position-Specific Score Matrices) have been applied to various problems in Bioinformatics. We study the following problem: given positive examples (sequences) andnegative examples (sequences), finda PSSM which correctly discriminates between positive andnegative examples. We prove that this problem is solvedin 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 similar results on deriving a mixture of PSSMs.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 13th Annual Symposium, CPM 2002, Proceedings
EditorsAlberto Apostolico, Masayuki Takeda
PublisherSpringer Verlag
Pages168-177
Number of pages10
ISBN (Electronic)9783540438625
DOIs
Publication statusPublished - 2002
Event13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002 - Fukuoka, Japan
Duration: Jul 3 2002Jul 5 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2373
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002
CountryJapan
CityFukuoka
Period7/3/027/5/02

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the complexity of deriving position specific score matrices from examples'. Together they form a unique fingerprint.

Cite this