Skip Navigation


Bioinformatics Advance Access originally published online on March 25, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/12/1887    most recent
bth175v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ljungberg, K.
Right arrow Articles by Carlborg, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ljungberg, K.
Right arrow Articles by Carlborg, O.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(12) © Oxford University Press 2004; all rights reserved.

Simultaneous search for multiple QTL using the global optimization algorithm DIRECT

K. Ljungberg 1,*, S. Holmgren 1 and Ö. Carlborg 2

1 Information Technology, Division of Scientific Computing, Uppsala University, P.O. Box 337,751 05 Uppsala, Sweden and 2 Genetics and Biometry, Roslin Institute, Roslin, Midlothian EH25 9PS, UK

Received on July 15, 2003; revised on December 18, 2003; accepted on February 26, 2004
Advance Access Publication March 25, 2004

Motivation: A simultaneous search is necessary for maximizing the power to detect epistatic quantitative trait loci (QTL). The computational complexity demands that the traditional exhaustive search be replaced by a more efficient global optimization algorithm.

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.

Availability: The code of the prototype implementation is available at http://user.it.uu.se/~kl/qtl_software.html

Contact: Kajsa.Ljungberg{at}it.uu.se

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
GeneticsHome page
J. Yang, W. Wu, and J. Zhu
Mapping Interspecific Genetic Architecture in a Host-Parasite Interaction System
Genetics, March 1, 2008; 178(3): 1737 - 1743.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. K. Estrada-Gil, J. C. Fernandez-Lopez, E. Hernandez-Lemus, I. Silva-Zolezzi, A. Hidalgo-Miranda, G. Jimenez-Sanchez, and E. E. Vallejo-Clemente
GPDTI: A Genetic Programming Decision Tree Induction method to find epistatic effects in common complex diseases
Bioinformatics, July 1, 2007; 23(13): i167 - i174.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Yang, J. Zhu, and R. W. Williams
Mapping the genetic architecture of complex traits in experimental populations
Bioinformatics, June 15, 2007; 23(12): 1527 - 1536.
[Abstract] [Full Text] [PDF]


Home page
GeneticsHome page
B. Feenstra, I. M. Skovgaard, and K. W. Broman
Mapping Quantitative Trait Loci by an Extension of the Haley-Knott Regression Method Using Estimating Equations
Genetics, August 1, 2006; 173(4): 2269 - 2282.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.