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

DOI10.1016/J.JDA.2006.10.006MaRDI QIDQ925067zbMATH OpenOpenAlexFDO

Authors Paul Horton, Wataru Fujibuchi

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

computational complexitycombinatoricsmotif discoverystring algorithmtranscription factor binding site prediction

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial Pattern Matching
• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
• Discovering almost any hidden motif from multiple sequences
• Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
• Sublinear time motif discovery from multiple sequences

Cites work

• scientific article; zbMATH DE number 1615272 (Why is no real title available?)
• Finding similar regions in many sequences
• Finding similar regions in many strings

Cited in

(2)

• scientific article; zbMATH DE number 2087052 (Why is no real title available?)
• Combinatorial Pattern Matching

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

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