(Heuristic search ,10 random addition replicates ,tree -bisection -reconnection (TBR) branch swapping),saving a maximum of 1000 most parsimonious trees per replicate.
(Heuristic search ,10 random addition replicates ,tree -bisection -reconnection (TBR) branch swapping),saving a maximum of 1000 most parsimonious trees per replicate.