本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2020-01-07
摘要
Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the 物種 where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying 演化ary tree. In practical applications this tree is unknown and the edges of the RBMGs are inferred by quantifying sequence similarity. Due to noise in the data, these empirically determined graphs in general violate the condition of being a "生物ly feasible" RBMG. Therefore, it is of practical interest in 計算 biology to correct the initial estimate. Here we consider deletion (remove at most k edges) and editing (add or delete at most k edges) problems. We show that the decision version of the deletion and editing problem to obtain RBMGs from vertex colored graphs is
※ 此為已發表論文，全文需透過期刊付費取得