|
|
|
|
|
|
|
Free Newsletters
Archive
My Subscriptions
News by Subject
News by Disease
News by Date
PLoS
Search News
Post Your News
JoVE
Job Seeker Login
Most Recent Jobs
Browse Biotech Jobs
Search Jobs
Post Resume
Career Fairs
Career Resources
For Employers
Regional News
US & Canada
Biotech Bay
Biotech Beach
Genetown
Pharm Country
BioCapital
BioMidwest
Bio NC
BioForest
Southern Pharm
BioCanada East
US Device
Europe
Asia
Market Summary
News
IPOs
Company Profiles
Companies
Events
Research Store
Biotech Events
Post an Event
Real Estate
Business Opportunities
|
|
|
|
PLoS By Category | Recent
PLoS Articles
|
|
Computer Science - Mathematics - Public Health and Epidemiology
|
Visualization of Pairwise and Multilocus Linkage Disequilibrium Structure Using Latent Forests
Published:
Tuesday, December 13, 2011
Author:
Raphaël Mourad et al.
by Raphaël Mourad, Christine Sinoquet, Christian Dina, Philippe Leray
Linkage disequilibrium study represents a major issue in statistical genetics as it plays a fundamental role in gene mapping and helps us to learn more about human history. The linkage disequilibrium complex structure makes its exploratory data analysis essential yet challenging. Visualization methods, such as the triangular heat map implemented in Haploview, provide simple and useful tools to help understand complex genetic patterns, but remain insufficient to fully describe them. Probabilistic graphical models have been widely recognized as a powerful formalism allowing a concise and accurate modeling of dependences between variables. In this paper, we propose a method for short-range, long-range and chromosome-wide linkage disequilibrium visualization using forests of hierarchical latent class models. Thanks to its hierarchical nature, our method is shown to provide a compact view of both pairwise and multilocus linkage disequilibrium spatial structures for the geneticist. Besides, a multilocus linkage disequilibrium measure has been designed to evaluate linkage disequilibrium in hierarchy clusters. To learn the proposed model, a new scalable algorithm is presented. It constrains the dependence scope, relying on physical positions, and is able to deal with more than one hundred thousand single nucleotide polymorphisms. The proposed algorithm is fast and does not require phase genotypic data.
More...
|
|
|
 |
|
|
|
|
|
|
|
|