Using graph models to find transcription factor modules: the hitting set problem and an exact algorithm

出版年份 2013 全文链接

标题

作者

关键词

Time Complexity, Bipartite Graph, Minimum Weight, Exact Algorithm, Multiple Instance

出版物

Algorithms for Molecular Biology

Volume 8, Issue 1, Pages 2

出版商

Springer Nature

发表日期

2013-01-17

DOI

10.1186/1748-7188-8-2

参考文献

查看 2 条相关文献

向作者/读者发起求助以获取更多资源

Protocol

在线求助

Reagent

在线求助

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More