2010, Also at University of Colombo School of Computing, Sri Lanka. Principal advisor: S. Holmgren. Co-advisors: Ö. Carlborg, SLU and R. Weerasinghe, UCSC)
2008, Mälardalen University College. Principal advisor: S. Holmgren. Co-advisors: L. Rönnegård, LCB and D. Silvestrov, MdH).
2005, Principal advisor: S. Holmgren. Co-advisor: Örjan Carlborg)The group collaborates closely with Örjan Carlborg's group
at the Swedish University of Agricultural Sciences (SLU) and Lars Rönnegård
at the Statistics group of Dalarna University. The group also has contacts with the research groups of Leif Andesson and Dietrich von Rosen at SLU.
Background: Most traits of medical or economical importance, such as blood pressure and cholesterol levels in humans, body weight of broiler chickens, and crop yield for maise and corn, are quantitative in nature. These traits are normally determined by the joint effect of multiple genes and the environment. Quantitative Trait Locus (QTL) mapping is a method for finding the genetic regions governing quantitative traits. Computationally, QTL mapping involves employing statistical models of the relation between phenotypes and genotypes of experimental data from populations for locating the most probable positions of the QTL and determining the statistical significance of the result. Such results can be useful in marker-assisted breeding, or as a candidate screening tool in basic research.
Deterministic global optimization methods for mapping of multiple QTL: The computations involve solving multidimensional global optimization problems for finding the most likely positions of the QTL. Using structure and knowledge from the application field, efficient deterministic schemes for the global optimization problems are derived, examined, and used for problems of interest in genetics. Also, versions of the schemes that can perform significance testing of a putative set of QTL positions very efficiently are derived.
Numerical methods for computing the QTL model fit: Different types of statistical models are used for evaluating the fit of a given set of QTL positions. In the most straight-forward scheme a linear model is used and the residual sum of squares is computed by solving a least-squares problem. Using alternative settings, a weighted least-square or a non-linear maximum-likelihood problem are solved. Introducing orthogonal model might facilitate model selection, i.e. selecting not only the most likely QTL positions, but through automated means determining the total number of QTL and where significance interactions can be found. The use of variance component models is rapidly increasing in the field of QTL analysis, and in this case a rather demanding non-linear optimization problem must be solved for each set of QTL positions. Using the structure of the QTL analysis problems, efficient algorithms for different types of model fit computations and model
selection settings are derived, analyzed and implemented.
High Performance Implementations: Even if efficient algorithms are used for the QTL search and QTL model evaluations, the computations are still demanding for models with many QTL. Parallel implementations on different types of high performance computers are developed and studied. Also, a web-based QTL portal using the software in the project is being developed, providing a basis for straightforward and practical use of the QTL mapping tool by genetics researchers.
HMMs for genotype probabilities: Existing tools for computing genotype probabilities, the basis for all models for QTL analysis, have proven unsufficient for our needs. We are therefore presenting the tool cnF2freq
which, based on Hidden Markov Models, can provide genotype and haplotype probabilities. Contact Carl Nettelblad for more information, a how-to and sample data will be presented here soon.
. In G3: Genes, Genomes, Genetics, volume 1, pp 57-64, 2011. (DOI
).
. In Proc. 14th European Workshop on QTL Mapping and Marker Assisted Selection, volume 5:3 of BMC Proceedings, pp S10:1-7, BioMed Central, London, 2011. (DOI
).
. In Proc. 2nd International Conference on Bioinformatics and Computational Biology, pp 202-209, ISCA, Cary, NC, 2010.
. In Advances and Applications in Bioinformatics and Chemistry, volume 3, pp 75-88, 2010. (DOI
).
. In Computational biology and chemistry (Print), volume 34, pp 34-41, 2010. (DOI
).
. In Proc. 32nd International Convention on Information and Communication Technology, Electronics and Microelectronics: Volume I, pp 281-284, MIPRO, Rijeka, Croatia, 2009.
. In Bioinformatics and Computational Biology, volume 5462 of Lecture Notes in Computer Science, pp 307-319, Springer-Verlag, Berlin, 2009. (DOI
).
. In Communications in statistics. Simulation and computation, volume 38, pp 1348-1364, 2009. (DOI
).
. In Journal of Computational Methods in Sciences and Engineering, volume 8, pp 53-67, 2008.
. In Proc. 3rd International Conference on e-Science and Grid Computing, pp 205-212, IEEE, Piscataway, NJ, 2007. (DOI
).
. In Applied Parallel Computing: State of the Art in Scientific Computing, volume 4699 of Lecture Notes in Computer Science, pp 627-636, Springer-Verlag, Berlin, 2007. (DOI
).
. In Genetics, volume 176, pp 1935-1938, 2007. (DOI
).
. In Bioinformatics, volume 20, pp 1887-1895, 2004. (DOI
).
. In Journal of Computational Biology, volume 9, pp 793-804, 2002. (DOI
).
. PARA 2008: State of the Art in Scientific and Parallel Computing, Norwegian University of Science and Technology, Trondheim, Norway, 2008.
. Technical report / Department of Information Technology, Uppsala University nr 2010-006, 2010. (External link).
. Technical report / Department of Information Technology, Uppsala University nr 2010-005, 2010. (External link).
. Technical report / Department of Information Technology, Uppsala University nr 2010-001, 2010. (External link).
. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2010-002, 2010. (External link).
. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 708, Acta Universitatis Upsaliensis, Uppsala, 2010. (fulltext
).
. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2007-005, 2007. (External link).
. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 133, Acta Universitatis Upsaliensis, Uppsala, 2005. (fulltext
).
. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-014, 2003. (External link).
. Kateryna Mishchenko. Ph.D. thesis, Mälardalen University Press Dissertations nr 59, Mälardalen University, Västerås, 2008.The numerical methods developed in the project are implemented in C and Matlab. Some of the codes have been incorporated into the publicly available and widely used WebQTL and R/qtl packages. Some code is available at the Software page
. We also have a specific page with information and code related to the cnF2freq codebase in different versions.