An evolutionary paradox on threadsnakes: Phenotypic and molecular evidence reveal a new and remarkably polymorphic species of Siagonodon (Serpentes: Leptotyphlopidae: Epictinae) from Amazonia

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

Threadsnakes are known for their conserved external morphology and historically controversial systematics, challenging taxonomic, biogeographic and evolutionary researches in these fields. Recent morphological studies—mostly based on µCT data of the skull and lower jaw—have resolved systematic issues within the group, for instance leading to the description of new taxa or re-positioning little-known scolecophidian taxa in the tree of life. Herein we describe a new polymorphic species of the genus Siagonodon from Amazonia based on morphological (external, osteology and hemipenis) and molecular data, and provide the first hemipenial description for the genus. We also reassign Siagonodon acutirostris to the genus Trilepida based on osteological data in combination with molecular evidence. The new species described represents an evolutionary paradox for scolecophidians because the species displays a remarkable variation in the shape of the snout region that is otherwise always highly conserved in this clade. Finally, this study reinforces the importance of protected areas as essential in maintaining vertebrate populations, including those that are not yet formally described.

Related collections

Most cited references 60

Record: found
Abstract: found
Article: not found

Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.

S Altschul (1997)

The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original. In addition, a method is introduced for automatically combining statistically significant alignments produced by BLAST into a position-specific score matrix, and searching the database using this matrix. The resulting Position-Specific Iterated BLAST (PSI-BLAST) program runs at approximately the same speed per iteration as gapped BLAST, but in many cases is much more sensitive to weak but biologically relevant sequence similarities. PSI-BLAST is used to uncover several new and interesting members of the BRCT superfamily.

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

Bookmark

Record: found
Abstract: found
Article: not found

A new look at the statistical model identification

H Akaike, Francisco Casacuberta (1975)

IEEE Transactions on Automatic Control, 19(6), 716-723

0 comments Cited 2992 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.