Carlborg, Örjan
- The Roslin Institute
Sammanfattning
Results: We have the previously known algorithm adapted DIRECT, to the problem of simultaneous mapping of multiple QTL. We have compared DIRECT with standard exhaustive search and a genetic algorithm previously used for QTL mapping in two dimensions. In all two- and three-QTL test cases, DIRECT accurately finds the global optimum two to four orders of magnitude faster than when using an exhaustive search, and one order of magnitude faster than when using the genetic algorithm. Thus, randomization testing for determining empirical significance thresholds for at least three QTL is made feasible by the use of DIRECT.
Publicerad i
Bioinformatics
2004, volym: 20, nummer: 12, sidor: 1887-1895
Utgivare: OXFORD UNIV PRESS
SLU författare
UKÄ forskningsämne
Genetik och genomik
Datavetenskap (datalogi)
Publikationens identifierare
- DOI: https://doi.org/10.1093/bioinformatics/bth175
Permanent länk till denna sida (URI)
https://res.slu.se/id/publ/57924