For a weighted and undirected graph with weights on vertices,we use two DNA strands of different lengths to encode each vertex and use one DNA strand with a length of 20 to encode each edge.
对于任一顶点赋权的连通无向图,我们用两个不同长度的DNA串去编码每个顶点,用一个长度为20的DNA串去编码每条边。
参考来源 - 赋权图上优化问题的DNA计算方法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐