New Bounds for Motif Finding in Strong Instances

DOI10.1007/11780441_10zbMath1196.68343OpenAlexW2148893137MaRDI QIDQ5307497

Daniel G. Brown, Broňa Brejová, Tomáš Vinař, Ian M. Harrower

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_10

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Related Items (1)

Consensus Patterns (Probably) Has no EPTAS

This page was built for publication: New Bounds for Motif Finding in Strong Instances