2015Unpublished venueOpen access

Three-taxon analysis can always successfully recognize groups based on putative reversals

Evgeny V. Mavrodiev

Open full text 29 citations

Abstract

Three-taxon analysis in it canonical form can always successfully recognize groups based on putative reversals if latter are coded as separate states before three-taxon permutations are derived from conventional matrices. This way of coding removes incongruence from either conventional multistate or three-taxon matrices and makes the discussions about symplesiomorphy as a putative homology unnecessary. The ability of conventional parsimony to recognize reversal-based clades is technically nothing more than grouping by plesiomorphic values. Therefore this solution cannot be accepted as a Cladistic approach to data and must be correctly classified as “post-Hennigian” or “phenetic”. The ability of three-taxon analysis to recognize groups based on the putative reversals may be viewed as a heuristic cladistics attempts to prevent this “phenetic” approach affecting the analysis of the data.

About this research paper

What this paper is about

Three-taxon analysis in it canonical form can always successfully recognize groups based on putative reversals if latter are coded as separate states before three-taxon permutations are derived from conventional matrices. This way of coding removes incongruence from either conventional multistate or three-taxon matrices and makes the discussions about symplesiomorphy as a putative homology unnecessary. The ability of conventional parsimony to recognize reversal-based clades is technically nothing more than grouping by plesiomorphic values. Therefore this solution cannot be accepted as a Cladistic approach to data and must be correctly classified as “post-Hennigian” or “phenetic”. The ability of three-taxon analysis to recognize groups based on the putative reversals may be viewed as a heuristic cladistics attempts to prevent this “phenetic” approach affecting the analysis of the data.

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Three-taxon analysis in it canonical form can always successfully recognize groups based on putative reversals if latter are coded as separate states before three-taxon permutations are derived from conventional matrices. This way of coding removes incongruence from either conventional multistate or three-taxon matrices and makes the discussions about symplesiomorphy as a putative homology unnecessary. The ability of conventional parsimony to recognize reversal-based clades is technically nothing more than grouping by plesiomorphic values. Therefore this solution cannot be accepted as a Cladistic approach to data and must be correctly classified as “post-Hennigian” or “phenetic”. The ability of three-taxon analysis to recognize groups based on the putative reversals may be viewed as a heuristic cladistics attempts to prevent this “phenetic” approach affecting the analysis of the data.

Key concepts: Taxon, Cladistics, Evolutionary biology, Clade, Biology, Paleontology, Phylogenetics, Genetics

Related papers

Back to paper searchBrowse research topicsOriginal source
Three-taxon analysis can always successfully recognize groups based on putative reversals — Research Paper | ScholarLens