Figure - PMC

Skip to main content

An official website of the United States government

Here's how you know

Here's how you know

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

View full-text article in PMC

. 2018 Feb 16;8:3209. doi: 10.1038/s41598-018-19996-6

Search in PMC
Search in PubMed
View in NLM Catalog
Add to search

© The Author(s) 2018

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

PMC Copyright notice

Maximum likelihood tree with branch lengths obtained from analysis of matrix M1. Tree is rooted with Symphylella vulgaris. Bootstrap support (BS) values for all analyses are summarized. BS values not indicated are 100%. Boxplots indicate bootstrap value ranges for each node across all analyses (A–J). Black boxes represent 90–99% BS, dark grey boxes 70–89% BS, light grey boxes BS less than 69% BS, and white boxes where the node whas not recovered for the analysis. (A) ExaML optimal ML tree for matrix M1. (B) ExaML optimal ML tree for matrix M2. (C) ExaML optimal ML tree for matrix M3. (D) ExaML optimal ML tree for matrix M4. (E) ASTRAL greedy consensus tree for matrix M1. (F) ASTRAL greedy consensus tree for matrix M2. (G) ASTRAL greedy consensus tree for matrix M3. (H) ASTRAL greedy consensus tree for matrix M4. (I) ExaML optimal ML tree for matrix M5. (J) ExaML optimal ML tree for matrix M6.