PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 15, 2020Molecular Ecology Resources1,687 citationsOpen Access

ASAP: assemble species by automatic partitioning

View Full Paper
NPNicolas PuillandreSBSophie BrouilletGAGuillaume Achaz

Key Points

Key points are not available for this paper at this time.

Abstract

Here, we describe Assemble Species by Automatic Partitioning (ASAP), a new method to build species partitions from single locus sequence alignments (i.e., barcode data sets). ASAP is efficient enough to split data sets as large 104 sequences into putative species in several minutes. Although grounded in evolutionary theory, ASAP is the implementation of a hierarchical clustering algorithm that only uses pairwise genetic distances, avoiding the computational burden of phylogenetic reconstruction. Importantly, ASAP proposes species partitions ranked by a new scoring system that uses no biological prior insight of intraspecific diversity. ASAP is a stand-alone program that can be used either through a graphical web-interface or that can be downloaded and compiled for local usage. We have assessed its power along with three others programs (ABGD, PTP and GMYC) on 10 real COI barcode data sets representing various degrees of challenge (from small and easy cases to large and complicated data sets). We also used Monte-Carlo simulations of a multispecies coalescent framework to assess the strengths and weaknesses of ASAP and the other programs. Through these analyses, we demonstrate that ASAP has the potential to become a major tool for taxonomists as it proposes rapidly in a full graphical exploratory interface relevant species hypothesis as a first step of the integrative taxonomy process.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Puillandre et al. (2020) studied this question.

synapsesocial.com/papers/69d7ae9cdcc7b92a43f30b4fhttps://doi.org/10.1111/1755-0998.13281
Ask AI
Helpful
Bookmark
Share
View Full Paper