「Ordered character」の版間の差分
提供: 広島大学デジタル博物館
ナビゲーションに移動検索に移動| 6行目: | 6行目: | ||
===Glossary of "Cladistics (2nd ed.)" by [[Kitching_Forey_Humphries_Williams_1998|Kitching et al. (1998)]]=== | ===Glossary of "Cladistics (2nd ed.)" by [[Kitching_Forey_Humphries_Williams_1998|Kitching et al. (1998)]]=== | ||
*A [[multistate_character|multistate character]] of which the [[order]] has been determined. Transformation between any two [[adjacent]] states costs the same number of steps (usually one, see [[direction]]), but transformation between two [[non-adjacent]] states costs the sum of the steps betweentheir implied adjacent states. For example, in the [[ordered_character|ordered character]], 0 <-> 1 <-> 2, the transformations 0 <-> 1 and 1 <-> 2 each cost the same number of steps but the transformation 0 <-> 2 costs twice as many (i.e. transformation proceeds as if via state 1). [[Wagner_optimization|Wagner optimization]] uses [[ordered_character|ordered characters]]. Cf. [[unordered]]. | *A [[multistate_character|multistate character]] of which the [[order]] has been determined. Transformation between any two [[adjacent]] states costs the same number of steps (usually one, see [[direction]]), but transformation between two [[non-adjacent]] states costs the sum of the steps betweentheir implied adjacent states. For example, in the [[ordered_character|ordered character]], 0 <-> 1 <-> 2, the transformations 0 <-> 1 and 1 <-> 2 each cost the same number of steps but the transformation 0 <-> 2 costs twice as many (i.e. transformation proceeds as if via state 1). [[Wagner_optimization|Wagner optimization]] uses [[ordered_character|ordered characters]]. Cf. [[unordered]]. | ||
| + | === Glossary of Plant Systematics (1st ed.) by [[Simpson_2006|Simpson (2006)]] === | ||
| + | * Referring to a transformation series in which the character states occur in a predetermined sequence. | ||
== 文献（引用） == | == 文献（引用） == | ||
2017年4月5日 (水) 08:20時点における版
ordered character
- （日本語）
- (Español)
Definition
Glossary of "Cladistics (2nd ed.)" by Kitching et al. (1998)
- A multistate character of which the order has been determined. Transformation between any two adjacent states costs the same number of steps (usually one, see direction), but transformation between two non-adjacent states costs the sum of the steps betweentheir implied adjacent states. For example, in the ordered character, 0 <-> 1 <-> 2, the transformations 0 <-> 1 and 1 <-> 2 each cost the same number of steps but the transformation 0 <-> 2 costs twice as many (i.e. transformation proceeds as if via state 1). Wagner optimization uses ordered characters. Cf. unordered.
Glossary of Plant Systematics (1st ed.) by Simpson (2006)
- Referring to a transformation series in which the character states occur in a predetermined sequence.
