An upper bound on the hardness of exact matrix based motif discovery

DOI10.1016/j.jda.2006.10.006zbMath1165.90608OpenAlexW1998247518MaRDI QIDQ925067

Wataru Fujibuchi, Paul Horton

Publication date: 29 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.10.006

zbMATH Keywords

combinatoricscomputational complexitymotif discoverystring algorithmtranscription factor binding site prediction

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Finding similar regions in many sequences
• Finding similar regions in many strings
• Unnamed Item

This page was built for publication: An upper bound on the hardness of exact matrix based motif discovery