Extracting best consensus motifs from positive and negative examples

DOI10.1007/3-540-60922-9_19zbMath1379.68181OpenAlexW1482079067MaRDI QIDQ4593932

Osamu Maruyama, Satoru Miyano, Erika Tateishi

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/3217

zbMATH Keywords

algorithmscomputational complexitygenome informatics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (1)

On learning unions of pattern languages and tree patterns in the mistake bound model.

This page was built for publication: Extracting best consensus motifs from positive and negative examples