def find_minimal_helices(nturn_starts):
    """
    Find helices on the basis of the n-turn beginnings lists
    Minimal helices are defined as consecutive n-turns
    """
    min_helices = {
        "3-min_helices": [],
        "4-min_helices": [],
        "5-min_helices": []
    }

    for n in [3, 4, 5]:

        name = str(n) + "-turn"
        list_nturns = nturn_starts[name]

        for i in range(len(list_nturns) - 1):
            if list_nturns[i+1] == list_nturns[i] + 1:
                helix_name = str(n) + "-min_helices"
                min_helices[helix_name].append(list_nturns[i])

    return min_helices