Anchored Phylogenomics, Evolution and Systematics of Elateridae: Are All Bioluminescent Elateroidea Derived Click Beetles?

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Click-beetles (Coleoptera: Elateridae) are an abundant, diverse, and economically important beetle family that includes bioluminescent species. To date, molecular phylogenies have sampled relatively few taxa and genes, incompletely resolving subfamily level relationships. We present a novel probe set for anchored hybrid enrichment of 2260 single-copy orthologous genes in Elateroidea. Using these probes, we undertook the largest phylogenomic study of Elateroidea to date (99 Elateroidea, including 86 Elateridae, plus 5 non-elateroid outgroups). We sequenced specimens from 88 taxa to test the monophyly of families, subfamilies and tribes. Maximum likelihood and coalescent phylogenetic analyses produced well-resolved topologies. Notably, the included non-elaterid bioluminescent families (Lampyridae + Phengodidae + Rhagophthalmidae) form a clade within the otherwise monophyletic Elateridae, and Sinopyrophoridae may not warrant recognition as a family. All analyses recovered the elaterid subfamilies Elaterinae, Agrypninae, Cardiophorinae, Negastriinae, Pityobiinae, and Tetralobinae as monophyletic. Our results were conflicting on whether the hypnoidines are sister to Dendrometrinae or Cardiophorinae + Negastriinae. Moreover, we show that fossils with the eucnemid-type frons and elongate cylindrical shape may belong to Eucnemidae, Elateridae: Thylacosterninae, ancestral hard-bodied cantharoids or related extinct groups. Proposed taxonomic changes include recognition of Plastocerini as a tribe in Dendrometrinae and Hypnoidinae stat. nov. as a subfamily within Elateridae.

Related collections

Most cited references 83

Record: found
Abstract: found
Article: found

Is Open Access

RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies

Alexandros Stamatakis (2014)

Motivation: Phylogenies are increasingly used in all fields of medical and biological research. Moreover, because of the next-generation sequencing revolution, datasets used for conducting phylogenetic analyses grow at an unprecedented pace. RAxML (Randomized Axelerated Maximum Likelihood) is a popular program for phylogenetic analyses of large datasets under maximum likelihood. Since the last RAxML paper in 2006, it has been continuously maintained and extended to accommodate the increasingly growing input datasets and to serve the needs of the user community. Results: I present some of the most notable new features and extensions of RAxML, such as a substantial extension of substitution models and supported data types, the introduction of SSE3, AVX and AVX2 vector intrinsics, techniques for reducing the memory requirements of the code and a plethora of operations for conducting post-analyses on sets of trees. In addition, an up-to-date 50-page user manual covering all new RAxML options is available. Availability and implementation: The code is available under GNU GPL at https://github.com/stamatak/standard-RAxML. Contact: alexandros.stamatakis@h-its.org Supplementary information: Supplementary data are available at Bioinformatics online.

0 comments Cited 7291 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: found

Is Open Access

IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies

Lam-Tung Nguyen, Heiko Schmidt, Arndt von Haeseler … (2014)

Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to find optimal trees, it is not clear whether the best tree is found. Thus, there is need for additional approaches that employ different search strategies to find ML trees and that are at the same time as fast as currently available ML programs. We show that a combination of hill-climbing approaches and a stochastic perturbation method can be time-efficiently implemented. If we allow the same CPU time as RAxML and PhyML, then our software IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3-97.1%.

0 comments Cited 6518 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: not found

MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform.

K Katoh (2002)

A multiple sequence alignment program, MAFFT, has been developed. The CPU time is drastically reduced as compared with existing methods. MAFFT includes two novel techniques. (i) Homo logous regions are rapidly identified by the fast Fourier transform (FFT), in which an amino acid sequence is converted to a sequence composed of volume and polarity values of each amino acid residue. (ii) We propose a simplified scoring system that performs well for reducing CPU time and increasing the accuracy of alignments even for sequences having large insertions or extensions as well as distantly related sequences of similar length. Two different heuristics, the progressive method (FFT-NS-2) and the iterative refinement method (FFT-NS-i), are implemented in MAFFT. The performances of FFT-NS-2 and FFT-NS-i were compared with other methods by computer simulations and benchmark tests; the CPU time of FFT-NS-2 is drastically reduced as compared with CLUSTALW with comparable accuracy. FFT-NS-i is over 100 times faster than T-COFFEE, when the number of input sequences exceeds 60, without sacrificing the accuracy.