Mod/Resc简约推理
Mod/Resc Parsimony Inference
摘要：
在本文中，我们解决了一个新的计算生物学问题，旨在了解一种机制，可能被用于遗传操纵自然昆虫种群感染的遗传，细胞内寄生细菌。在这个问题中，我们用\textsc{Mod/Resc Parsimony Inference}表示，我们给出一个布尔矩阵，目标是找到另外两个具有最少列数的布尔矩阵，以便对这些矩阵进行适当定义的操作返回输入。我们表明，这是正式等价的\textsc{Bipartite Biclique Edge Cover}问题，并得出一些复杂性的结果，我们的问题使用这种等价。我们提供了一个新的，固定参数的易处理的方法来解决这两个稍微改进后，以前发表的算法的\textsc{Bipartite Biclique Edge Cover}。最后，我们提出了实验结果，我们将我们的一些技术应用到现实生活中的数据集。
英文摘要：
We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc Parsimony Inference}, we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these matrices gives back the input. We show that this is formally equivalent to the \textsc{Bipartite Biclique Edge Cover} problem and derive some complexity results for our problem using this equivalence. We provide a new, fixed-parameter tractability approach for solving both that slightly improves upon a previously published algorithm for the \textsc{Bipartite Biclique Edge Cover}. Finally, we present experimental results where we applied some of our techniques to a real-life data set.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
