{"title":"On the problem of compensatory mating in animal breeding","authors":"Ana Paula Lüdtke Ferreira","doi":"10.5753/weit.2021.18928","DOIUrl":null,"url":null,"abstract":"Animal breeding relies on two processes to achieve its objectives: the selection and the mating systems. Mating systems devise a particular plan to perform one or more breeding goals, which often encompass improving the herd's health and maximising financial gains in animal production systems. Compensatory mating is a strategy to produce animals with more homogeneous selection trait characteristics, discarding the production of exceptional animals in favour of a more balanced herd. This paper defines and investigates the complexity class of the optimal compensatory mating problem, proving that a polynomial-time algorithm can solve it.","PeriodicalId":216839,"journal":{"name":"Anais do VI Workshop-Escola de Informática Teórica (WEIT 2021)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do VI Workshop-Escola de Informática Teórica (WEIT 2021)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/weit.2021.18928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Animal breeding relies on two processes to achieve its objectives: the selection and the mating systems. Mating systems devise a particular plan to perform one or more breeding goals, which often encompass improving the herd's health and maximising financial gains in animal production systems. Compensatory mating is a strategy to produce animals with more homogeneous selection trait characteristics, discarding the production of exceptional animals in favour of a more balanced herd. This paper defines and investigates the complexity class of the optimal compensatory mating problem, proving that a polynomial-time algorithm can solve it.