Abstract

Sequences of the small subunit (SSU) ribosomal RNA are considered useful for reconstructing the tree of life because this molecule is found in all organisms and is large enough not to have become saturated with multiple mutations. However, these data sets are large, difficult to align, and have extreme biases in base compositions which makes their phylogenetic signal ambiguous. Large ambiguous data sets may have many most-parsimonious trees, and finding them all may be impossible using convential phylogenetic methods. To examine the reliability of the number and relationships of eukaryotic kingdoms proposed by previous analyses of the SSU, we calculated trees from aligned sequences from eukaryotes in the Ribosomal Database Project using parsimony jackknifing which uses a resampling procedure to rapidly search large data sets for the branches that are strongly supported and eliminates poorly supported groups. Two separate analyses were carried out: an analysis in which all bases were equally weighted, and one in which transversions only were used. The parsimony jackknife procedure was able to efficiently find trees in which most major groups of eukaryotes were supported and in which some evolutionary hypotheses proposed by previous workers were tested. The relationships of these major groups to each other were largely unresolved, indicating that the SSU data, as represented in this database, is insufficient for answering questions about these deep branches. Interestingly, the analysis of transitions differs from the results of the entire data set, primarily being less resolved. This indicates that transversional mutations are important contributors to the resolved structure of the tree.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.