Loading...
Projects / Programmes source: ARIS

Optimization of algorithms for evaluation of (restricted) maximum likelihood function for large systems with application in animal science

Research activity

Code Science Field Subfield
4.02.01  Biotechnical sciences  Animal production  Genetics and selection 

Code Science Field
B110  Biomedical sciences  Bioinformatics, medical informatics, biomathematics biometrics 
B400  Biomedical sciences  Zootechny, animal husbandry, breeding 
Keywords
livestock production, selection, statistics, mixed model methodology, prediction of breeding value, estimation of dispersion parameters, variance-covariance components, litter size, fattening traits, test-day records, computer science, programming, data structure, finite universe dictionary, sparce matrices
Evaluation (rules)
source: COBISS
Researchers (11)
no. Code Name and surname Research area Role Period No. of publicationsNo. of publications
1.  04967  PhD Andrej Brodnik  Computer intensive methods and applications  Researcher  1996 - 2001  449 
2.  05096  MSc Marko Čepon  Animal production  Researcher  1999 - 2001  458 
3.  08697  MSc Marjana Drobnič  Animal production  Researcher  1996 - 2001  208 
4.  08187  PhD Antonija Holcman  Animal production  Researcher  1999 - 2001  401 
5.  06374  MSc Ajda Kermauner Kavčič  Animal production  Researcher  1999 - 2001  342 
6.  06537  PhD Dragomir Kompan  Animal production  Researcher  1999 - 2001  740 
7.  09755  PhD Milena Kovač  Animal production  Head  1998 - 2001  1,215 
8.  02980  PhD Janez Pogačar  Animal production  Researcher  1996 - 2001  238 
9.  04692  PhD Ivan Štuhec  Animal production  Researcher  1996 - 2001  429 
10.  00937  PhD Franc Zagožen  Animal production  Researcher  1996 - 2001  176 
11.  00921  PhD Silvester Žgur  Animal production  Researcher  1999 - 2001  465 
Organisations (1)
no. Code Research organisation City Registration number No. of publicationsNo. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,227 
Abstract
A novel data structure was introduced to store sparse coefficient matrices of mixed model equations. The goal was to minimiye the space for matrix presentation and the time of an access to the matrix element. The siye of our data structure is close to the information theoretic minimum (it differs in the second order term) and permits constant access to the matrix elements and a constant amortiyed time with a high probabilitz for the insertion of a new element in the matrix and a deletion of an existing element. The algorithm was tested in a setup of mixed model equations that is used for genetic evaluation of breeding animals and estimation of dispersion parameters. As a bz-product we get estimates od dispersion parameters for test-daz records in goats and sheep, fertilitz and fattening traits in pigs. During our work we also had to do some basic research in datastructures and algorithms. From this research we developed, beside thealgorithms used in prediction of breeding values a novel datadata structure for a succinct representation of Huffman trees. Thisdata structure is space optimal and also permits optimal decoding ofHuffman encoded text. The techniques developed in prediction of breeding values proved to be useful also in various algorithmsused in data communication and in algorithms for the maintenance ofprioritz queues
Views history
Favourite