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

DOI10.1016/J.JDA.2006.10.006zbMATH Open1165.90608OpenAlexW1998247518MaRDI QIDQ925067FDOQ925067

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

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

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)

Cites Work

• Finding similar regions in many strings
• Finding similar regions in many sequences
• Title not available (Why is that?)

Cited In (2)

• Combinatorial Pattern Matching
• Title not available (Why is that?)

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)