Effectiveness of nearest-neighbor data adjustment in a clonal test of redwood

被引:0
|
作者
Anekonda, TS [1 ]
Libby, WJ [1 ]
机构
[1] UNIV CALIF BERKELEY,DEPT FORESTRY & RESOURCE MANAGEMENT,BERKELEY,CA 94720
关键词
analysis of variance; correlation; environmental heterogeneity; field-test design; heritability; selection efficiency; test power;
D O I
暂无
中图分类号
S7 [林业];
学科分类号
0829 ; 0907 ;
摘要
Tree-to-tree environmental correlations were estimated for various traits in a clonal experiment with coast redwood (Sequoia sempervirens (D. DON) ENDL.). A nearest-neighbor adjustment was performed to reduce the effects on individual-tree data of environmental gradients and patchiness within the test site. The size of the environmental correlation proved reliable as a predictor of the usefulness of neighbor adjustment. Some results of the neighbor adjustments were: (a) clonal means and rankings for metric traits were changed, in some cases substantially so; (b) for traits with neighbor-tree correlations greater than 0.15, estimates of within-clone components of variance were substantially decreased; (c) estimates of among-clone components of variance were moderately but consistently increased; (d) broad-sense heritabilities and predicted genetic gains were thus increased. Estimates of among-stand components of variance were little changed.
引用
收藏
页码:46 / 51
页数:6
相关论文
共 50 条
  • [1] Efficient Nearest-Neighbor Data Sharing in GPUs
    Nematollahi, Negin
    Sadrosadati, Mohammad
    Falahati, Hajar
    Barkhordar, Marzieh
    Drumond, Mario Paulo
    Sarbazi-Azad, Hamid
    Falsafi, Babak
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2021, 18 (01)
  • [2] Data Acquisition for Probabilistic Nearest-Neighbor Query
    Lin, Yu-Chieh
    Yang, De-Nian
    Shuai, Hong-Han
    Chen, Ming-Syan
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (02) : 410 - 427
  • [3] ON NEAREST-NEIGHBOR GRAPHS
    PATERSON, MS
    YAO, FF
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 416 - 426
  • [4] On Nearest-Neighbor Graphs
    D. Eppstein
    M. S. Paterson
    F. F. Yao
    Discrete & Computational Geometry, 1997, 17 : 263 - 282
  • [5] Nearest-neighbor methods
    Sutton, Clifton
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2012, 4 (03): : 307 - 309
  • [6] On nearest-neighbor graphs
    Eppstein, D
    Paterson, MS
    Yao, FF
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 17 (03) : 263 - 282
  • [7] ANALYZING BINARY LATTICE DATA WITH NEAREST-NEIGHBOR PROPERTY
    STRAUSS, DJ
    JOURNAL OF APPLIED PROBABILITY, 1975, 12 (04) : 702 - 712
  • [8] Tensored nearest-neighbor classifiers
    Chalasani, V
    Beling, PA
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 2913 - 2916
  • [9] NEAREST-NEIGHBOR CLASSIFIER FOR THE PERCEPTRON
    BOUTEN, M
    VANDENBROECK, C
    EUROPHYSICS LETTERS, 1994, 26 (01): : 69 - 74
  • [10] NEAREST-NEIGHBOR ANALYSIS IN PRACTICE
    HINZ, PN
    IOWA STATE JOURNAL OF RESEARCH, 1987, 62 (02): : 199 - 217