scientific article; zbMATH DE number 2087052

MaRDI QIDQ4737698zbMATH OpenFDO

Authors Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730168.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of deriving position specific score matrices from positive and negative sequences
• Calculating PSSM probabilities with lazy dynamic programming
• Large Scale Matching for Position Weight Matrices
• Fast profile matching algorithms - A survey
• An upper bound on the hardness of exact matrix based motif discovery

Cited in

(1)

• Calculating PSSM probabilities with lazy dynamic programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737698)