Jump to ContentJump to Main Navigation
Evolution and Selection of Quantitative Traits$
Users without a subscription are not able to see the full content.

Bruce Walsh and Michael Lynch

Print publication date: 2018

Print ISBN-13: 9780198830870

Published to Oxford Scholarship Online: September 2018

DOI: 10.1093/oso/9780198830870.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 30 November 2020

Family-Based Selection

Family-Based Selection

Chapter:
(p.719) 21 Family-Based Selection
Source:
Evolution and Selection of Quantitative Traits
Author(s):

Bruce Walsh

Michael Lynch

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198830870.003.0021

A number of selection schemes (especially in plant breeding) are based on using family information. Individuals may be chosen based on the mean of their families (among-family selection), on their standing within their family (either strict within-family selection or family-deviations selection), or on some weighted combination of these two factors (family index selection). This chapter reviews the general theory of response in such settings and examines the relative effectiveness of a number of different family-based selection decisions.

Keywords:   among-family selection, autotetraploids, ear-to-row selection, family-deviations selection, Lush family index, plant breeding, progeny testing, recombination unit, selection unit, within-family selection

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .