Bayesian inference of interactions in biological problems
Our rough guess is there are 37,000 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 28 minutes to read. With a half hour per day, this will take 5 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
37,000 words, Guess
Page Count
148 pages
Identifiers
- OCLC Control Number477172698
- Open LibraryOL45212599M
Description
Recent development of bio-technologies such as microarrays and high-throughput sequencing has greatly accelerated the pace of genetics experimentation and discoveries. As a result, large amounts of high-dimensional genomic data are available in population genetics and medical genetics. With millions of biomarkers, it is a very challenging problem to search for the disease-associated or treatment-associated markers, and infer the complicated interaction (correlation) patterns among these markers. In this dissertation, I address Bayesian inference of interactions in two biological research areas: whole-genome association studies of common diseases, and HIV drug resistance studies. For whole-genome association studies, we have developed a Bayesian model for simultaneously inferring haplotype-blocks and selecting SNPs within blocks that are associated with the disease, either individually, or through epistatic interactions with others. Simulation results show that this approach is uniformly more powerful than other epistasis mapping methods. When applied to type 1 diabetes case-control data, we found novel features of interaction patterns in MHC region on chromosome 6. For HIV drug resistance studies, by probabilistically modeling mutations in the HIV-1 proteases isolated from drug-treated patients, we have derived a statistical procedure that first detects potentially complicated mutation combinations and then infers detailed interacting structures of these mutations. Finally, the idea of recursively exploring the dependence structure of interactions in the above two research studies can be generalized to infer the structure of Directed Acyclic Graphs. It can be shown that if the generative distribution is DAG-perfect, then asymptotically the algorithm will find the perfect map with probability 1.
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!