You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: sate/settings.py
+1-1
Original file line number
Diff line number
Diff line change
@@ -74,7 +74,7 @@ def __init__(self):
74
74
self.sate.add_option('aligner', StringUserSetting(name='aligner', default='mafft', short_name=None, help='The name of the alignment program to use for subproblems.', subcategory='tools'))
75
75
self.sate.add_option('merger', StringUserSetting(name='merger', default='muscle', short_name=None, help='The name of the alignment program to use to merge subproblems.', subcategory='tools'))
76
76
self.sate.add_option('tree_estimator', StringUserSetting(name='tree_estimator', default='fasttree', short_name=None, help='The name of the tree inference program to use to find trees on fixed alignments.', subcategory='tools'))
77
-
self.sate.add_option('break_strategy', ChoiceUserSetting(name='break_strategy', default='longest', choices=['centroid', 'longest'], multiple_choices=True, short_name=None, help='The method for choosing an edge when bisecting the tree during decomposition', subcategory='decomposition'))
77
+
self.sate.add_option('break_strategy', ChoiceUserSetting(name='break_strategy', default='centroid', choices=['centroid', 'longest'], multiple_choices=True, short_name=None, help='The method for choosing an edge when bisecting the tree during decomposition', subcategory='decomposition'))
78
78
self.sate.add_option('max_subproblem_size', IntUserSetting(name='max_subproblem_size', default=3, min=0, max=None, short_name=None, help='The maximum size (number of leaves) of subproblems. When a subproblem contains this number of leaves (or fewer), then it will not be decomposed further.', subcategory='decomposition'))
79
79
self.sate.add_option('max_subproblem_frac', FloatUserSetting(name='max_subproblem_frac', default=0.5, min=0.0, max=None, short_name=None, help='The maximum size (number of leaves) of subproblems specified in terms as a proportion of the total number of leaves. When a subproblem contains this number of leaves (or fewer), then it will not be decomposed further.', subcategory='decomposition'))
80
80
self.sate.add_option('start_tree_search_from_current', BoolUserSetting(name='start_tree_search_from_current', default='False', short_name=None, help='If selected that the tree from the previous iteration will be given to the tree searching tool as a starting tree.', subcategory='searching'))
<choicevalue="centroid"><help>The edge that comes closest to dividing the tree into two equally sized subtrees (in terms of the number of leaves).</help></choice>
127
127
<choicevalue="longest" ><help>Longest edge in the tree</help></choice>
128
128
<help>The method for choosing an edge when bisecting the tree during decomposition</help>
0 commit comments