![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this study, we propose several improvements of the Average Information Restricted Maximum Likelihood algorithms for estimating the variance components for genetic mapping of quantitative traits. The improved methods are applicable when two variance components are to be estimated. The improvements are related to the algebraic part of the methods and utilize the properties of the underlying matrix structures.
In contrast to previously developed algorithms, the explicit computation of a matrix inverse is replaced by the solution of a linear system of equations with multiple right-hand sides, based on a particular matrix decomposition. The computational costs of the proposed algorithms are analyzed and compared.
Acknowledgments
K. Mishchenko expresses her gratitude to Aleksandr Zheltukhin and Sverker Holmgren for the valuable discussions and support. The authors are indebted to Lars Rönnegård for the helpful discussions to better understand the characteristics of the underlying real application and the behavior of the obtained solution. The critical remarks and advice given by Per Lödstedt regarding improvements of the algorithm developed in Mishchenko et al. (Citation2007) were important and stimulated the presented work.
The authors also thank the anonymous referee for his/her careful reading and numerous suggestions which led to improvements both in the structure and style of the article.