For faster navigation, this Iframe is preloading the Wikiwand page for Three-taxon analysis.

Three-taxon analysis

Three-taxon analysis (3ia). Modified from Figure 1 from Grand A, Corvez A, Duque Velez LM, Laurin M. 2013.[1]

Three-taxon analysis (or TTS, three-item analysis, 3ia) is a cladistic based method of phylogenetic reconstruction. Introduced by Nelson and Platnick in 1991[2] to reconstruct organisms' phylogeny, this method can also be applied to biogeographic areas. It attempts to reconstruct complex phylogenetic trees by breaking the problem down into simpler chunks. Rather than try to resolve the relationships of all X taxa at once, it considers taxa 3 at a time. It is relatively easy to generate three-taxon statements (3is); that is, statements of the form "A and B are more closely related to one another than to C".[3] Once each group of three taxa has been considered, the method constructs a tree that is consistent with as many three-item statements as possible.[3]

From a theoretical point of view, the method has three main problems: (1) character evolution is a priori assumed to be irreversible; (2) 3is that are not logically independent are treated as if they are; (3) 3is that are considered as independent support for a given tree may be mutually exclusive on that tree. [4]

A computer program that implement three-taxon analysis is LisBeth[5] (for systematic and biogeographic studies). LisBeth have been freely released.[6] A recent simulation-based study found that Three-taxon analysis yields good power and an error rate intermediate between parsimony with ordered states and parsimony with unordered states.[1]

See also


  1. ^ a b Grand, Anaïs; Corvez, Adèle; Duque Velez, Lina Maria; Laurin, Michel (2013). "Phylogenetic inference using discrete characters: Performance of ordered and unordered parsimony and of three-item statements". Biological Journal of the Linnean Society. 110 (4): 914–930. doi:10.1111/bij.12159.
  2. ^ Nelson, G.; Platnick, N. I. (1991). "Three-Taxon Statements: A More Precise Use of Parsimony?". Cladistics. 7 (4): 351. doi:10.1111/j.1096-0031.1991.tb00044.x. S2CID 86270478.
  3. ^ a b Zaragueta-Bagils, R.; Bourdon, E. (2007). "Three-item analysis: Hierarchical representation and treatment of missing and inapplicable data". Comptes Rendus Palevol. 6 (6–7): 527. doi:10.1016/j.crpv.2007.09.013.
  4. ^ De Laet, J.; Smets, E. (1998). "On the three-taxon approach to parsimony analysis". Cladistics. 14 (4): 363–381. doi:10.1111/j.1096-0031.1998.tb00344.x. PMID 34929915. S2CID 221583681.
  5. ^ Bagils, R. Z. E.; Ung, V.; Grand, A. S.; Vignes-Lebbe, R. G.; Cao, N. L.; Ducasse, J. (2012). "LisBeth: New cladistics for phylogenetics and biogeography". Comptes Rendus Palevol. 11 (8): 563. doi:10.1016/j.crpv.2012.07.002.
  6. ^ "LisBeth package".
{{bottomLinkPreText}} {{bottomLinkText}}
Three-taxon analysis
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!

Your input will affect cover photo selection, along with input from other users.


Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?