如何简化群体遗传学模拟代码？优化单倍体与二倍体随机交配冗余实现

嘿，你提到的用字典优化交配模拟代码的想法完全可行！冗余的if-elif堆确实是这类场景的重灾区，用字典来映射规则既能简化代码，又能提升可维护性。我来给你演示下具体的优化思路：

先看典型的冗余代码示例 #

假设你的原始代码大概是这样（充满了重复的条件判断）：

import random

# 定义单倍体和二倍体群体
haplotypes = ["A", "a", "B", "b"]
diploids = ["AA", "Aa", "BB", "Bb", "ab", "Ab"]

def mate(haplotype, diploid):
    # 排除含自身同源单倍体的二倍体
    if haplotype in diploid:
        return None
    # 大量重复的条件判断处理不同交配组合
    if haplotype == "A" and diploid == "Bb":
        return random.choice(["AB", "Ab"])
    elif haplotype == "A" and diploid == "ab":
        return random.choice(["Aa", "Ab"])
    elif haplotype == "a" and diploid == "BB":
        return random.choice(["aB", "aB"])
    elif haplotype == "a" and diploid == "Bb":
        return random.choice(["aB", "ab"])
    elif haplotype == "B" and diploid == "Aa":
        return random.choice(["BA", "Ba"])
    elif haplotype == "B" and diploid == "ab":
        return random.choice(["Ba", "Bb"])
    elif haplotype == "b" and diploid == "AA":
        return random.choice(["bA", "bA"])
    elif haplotype == "b" and diploid == "Aa":
        return random.choice(["bA", "ba"])
    else:
        return None

# 模拟随机交配
def simulate_mating():
    selected_hap = random.choice(haplotypes)
    valid_diploids = [d for d in diploids if selected_hap not in d]
    if not valid_diploids:
        return None
    selected_dip = random.choice(valid_diploids)
    return mate(selected_hap, selected_dip)

字典优化后的代码 #

我们可以把所有交配规则集中到一个字典里，用(单倍体, 二倍体)作为键，对应的后代列表作为值，彻底消除重复判断：

import random

# 定义单倍体和二倍体群体
haplotypes = ["A", "a", "B", "b"]
diploids = ["AA", "Aa", "BB", "Bb", "ab", "Ab"]

# 用字典统一管理交配规则：键为交配组合，值为可能的后代
mating_rules = {
    ("A", "Bb"): ["AB", "Ab"],
    ("A", "ab"): ["Aa", "Ab"],
    ("a", "BB"): ["aB", "aB"],
    ("a", "Bb"): ["aB", "ab"],
    ("B", "Aa"): ["BA", "Ba"],
    ("B", "ab"): ["Ba", "Bb"],
    ("b", "AA"): ["bA", "bA"],
    ("b", "Aa"): ["bA", "ba"]
}

def mate(haplotype, diploid):
    # 先过滤无效组合
    if haplotype in diploid:
        return None
    # 从字典中获取对应规则，随机返回后代
    possible_offspring = mating_rules.get((haplotype, diploid))
    return random.choice(possible_offspring) if possible_offspring else None

# 模拟随机交配逻辑不变
def simulate_mating():
    selected_hap = random.choice(haplotypes)
    valid_diploids = [d for d in diploids if selected_hap not in d]
    if not valid_diploids:
        return None
    selected_dip = random.choice(valid_diploids)
    return mate(selected_hap, selected_dip)

优化后的核心优势 #

• 减少冗余：把几十行的if-elif压缩成一个字典，代码量骤减，逻辑更集中。
• 易维护性：后续要修改或新增交配规则，直接在mating_rules字典里更新即可，不用动核心函数逻辑。
• 可读性提升：所有交配组合和对应的后代一目了然，比嵌套的条件判断更容易理解。

更进一步：通用逻辑抽象 #

如果你的交配规则有通用规律（比如后代就是单倍体加上二倍体中的任意一个单倍体），还可以彻底抛弃硬编码的字典，用逻辑动态生成后代：

def mate(haplotype, diploid):
    if haplotype in diploid:
        return None
    # 动态生成可能的后代：单倍体 + 二倍体的任意一个单体
    dip_components = list(diploid)
    possible_offspring = [f"{haplotype}{comp}" for comp in dip_components]
    return random.choice(possible_offspring)

这种方式完全不需要维护规则字典，代码最简洁，扩展性也最强。

内容的提问来源于stack exchange，提问作者Ava Xue