Your English writing platform
Discover LudwigSuggestions(1)
Exact(7)
The phylogenetic tree was constructed by the neighbor-joining (NJ) method using the NJ algorithm implemented in Molecular Evolutionary Genetics Analysis (MEGA) software version 4.0 [ 31].
Trees were built using the NJ algorithm with the K2P model.
Trees were constructed using the NJ algorithm [ 42] implemented in Neighbour in PHYLIP.
Based on 414 neutral loci, the phylogenetic analysis using the NJ algorithm partitioned the 407 accessions into two major groups and one admixed group.
Phylogenetic trees were reconstructed from these alignments using the NJ algorithm implemented in ClustalX or using the parsimony method (PHYLYP package).
Concatenated gene-by-gene alignments of these (Sheppard et al. 2012) were produced using MAFFT (Katoh et al. 2002) and used to create phylogenetic trees using the NJ algorithm implemented in FastTree (Price et al. 2010).
Similar(53)
Support for the tree topology was obtained by 1000 bootstrap replications using the NJ or MP algorithms [ 48].
Note that this is a direct generalization of the selection criterion used in the NJ algorithm [ 2].
Phylogenetic analysis was carried out using the NJ method in MEGA 3.0 program [ 65] and Maximum Likelihood (ML) optimality criteria in PHYML algorithm [ 66].
Trees were generated using the NJ and ME methods.
Alignment of the gene copies was performed using ClustalW via the EBI website [ 38], and ClustalX used to generate each tree using the Saitou/Nei NJ algorithm.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com