maximal clique

基本解釋

In this article, we introduce maximal connected subgraphs, maximal clique and perfect match of graph theory in biology especially in the study of protein structure research applications.
本文介紹了最大連通子圖、最大團(tuán)和完美匹配等圖論知識(shí)在生物學(xué)尤其在研究蛋白質(zhì)結(jié)構(gòu)研究方面的應(yīng)用。
Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc.
生物分子計(jì)算已成功地應(yīng)用于計(jì)算哈密頓路徑、最大集合以及邏輯運(yùn)算中的SAT類問題等 NP完全問題。