Abstract
Background: The Genome Search Meta-Analysis (GSMA) method enables researchers to pool results across genome-wide linkage studies, to increase the power to detect linkage. Results from individual studies must be extracted, with the maximum evidence for linkage placed into bins, usually of 30 cM width, and ranked within the study. Ranks are then summed across studies, with high summed ranks potentially showing evidence for linkage in the meta-analysis. Objectives: In this paper we study the properties of the GSMA method considering two different issues: (1) data binning from genome-wide results when indexed markers or graphs are available, based on either predefined boundary markers, or equal-length bins; (2) the use of selected instead of genome-wide results, using simulation to estimate power and type I error rates of GSMA. This is relevant when published papers show only summary results (e.g. with NPL score >1). Results: Using digitizing software to extract linkage statistics from graphs and assigning equal bin length is accurate, with the resulting ranking of bins similar to those defined through boundary markers. Simulation results show that power can fall substantially when genome-wide results are not available, particularly when only results from a single marker are available in a linked region. However there is no increase in false positive findings. Conclusions: The GSMA method is robust across different bin definitions and methods of data presentation and extraction. Using studies based on only the top ranked bins does not produce false positive results, but lacks power to detect genes conferring a modest increase in risk. Therefore, we advise that effort should be made to obtain genome-wide results from investigators or from published papers to avoid limiting the utility of the GSMA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.