Character selection algorithms

From Species-ID
Revision as of 11:58, 4 April 2011 by Gregor Hagedorn (Talk | contribs) (Created page with "In a multi-access identification key ("matrix key", e.g. DELTA, Lucid, or xper2), the user selects from a list of all characters or features. However, selecting a good character ...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

In a multi-access identification key ("matrix key", e.g. DELTA, Lucid, or xper2), the user selects from a list of all characters or features. However, selecting a good character from a long list of alphabetically or hierarchically ordered characters is a significant task. Character selection is therefore often algorithmically supported. Similarly, where a single-access key (= dichotomous or polytomous) is created from a matrix, a selection of best characters is necessary. This page gives an overview over some suitable algorithms.

Please contribute to lay down more information on the read links not elaborated yet!