Premium
Character Coding and Inapplicable Data
Author(s) -
Strong Ellen E.,
Lipscomb Diana
Publication year - 1999
Publication title -
cladistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.323
H-Index - 92
eISSN - 1096-0031
pISSN - 0748-3007
DOI - 10.1111/j.1096-0031.1999.tb00272.x
Subject(s) - character (mathematics) , coding (social sciences) , taxon , character evolution , computer science , biology , artificial intelligence , evolutionary biology , mathematics , ecology , genetics , statistics , phylogenetics , clade , geometry , gene
Inapplicable character states occur when character complexes are absent or reduced in some of the taxa. Several approaches have been proposed for representing such states in a character matrix so that the inapplicable condition has no effect on the placement of taxa and/or the applicable states are independent and not redundant. Here we examine each of these approaches and demonstrate that all have shortcomings. Coding inapplicables as “?” (reductive coding), although flawed, is currently the best way to analyze data sets that contain inapplicable character states.