Browse
Submit Data
Databases
API
Help

Dataset Information

25 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Multilocus association mapping using variable-length Markov chains.

ABSTRACT: I propose a new method for association-based gene mapping that makes powerful use of multilocus data, is computationally efficient, and is straightforward to apply over large genomic regions. The approach is based on the fitting of variable-length Markov chain models, which automatically adapt to the degree of linkage disequilibrium (LD) between markers to create a parsimonious model for the LD structure. Edges of the fitted graph are tested for association with trait status. This approach can be thought of as haplotype testing with sophisticated windowing that accounts for extent of LD to reduce degrees of freedom and number of tests while maximizing information. I present analyses of two published data sets that show that this approach can have better power than single-marker tests or sliding-window haplotypic tests.

SUBMITTER: Browning SR

PROVIDER: S-EPMC1474089 | biostudies-literature | 2006 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Multilocus association mapping using variable-length Markov chains.

Browning Sharon R SR

American journal of human genetics 20060407 6

I propose a new method for association-based gene mapping that makes powerful use of multilocus data, is computationally efficient, and is straightforward to apply over large genomic regions. The approach is based on the fitting of variable-length Markov chain models, which automatically adapt to the degree of linkage disequilibrium (LD) between markers to create a parsimonious model for the LD structure. Edges of the fitted graph are tested for association with trait status. This approach can b ...[more]

PMID: 16685642

Similar Datasets

Fast parallel construction of variable-length Markov chains.

Project description:BackgroundAlignment-free methods are a popular approach for comparing biological sequences, including complete genomes. The methods range from probability distributions of sequence composition to first and higher-order Markov chains, where a k-th order Markov chain over DNA has [Formula: see text] formal parameters. To circumvent this exponential growth in parameters, variable-length Markov chains (VLMCs) have gained popularity for applications in molecular biology and other areas. VLMCs adapt the depth depending on sequence context and thus curtail excesses in the number of parameters. The scarcity of available fast, or even parallel software tools, prompted the development of a parallel implementation using lazy suffix trees and a hash-based alternative.ResultsAn extensive evaluation was performed on genomes ranging from 12Mbp to 22Gbp. Relevant learning parameters were chosen guided by the Bayesian Information Criterion (BIC) to avoid over-fitting. Our implementation greatly improves upon the state-of-the-art even in serial execution. It exhibits very good parallel scaling with speed-ups for long sequences close to the optimum indicated by Amdahl's law of 3 for 4 threads and about 6 for 16 threads, respectively.ConclusionsOur parallel implementation released as open-source under the GPLv3 license provides a practically useful alternative to the state-of-the-art which allows the construction of VLMCs even for very large genomes significantly faster than previously possible. Additionally, our parameter selection based on BIC gives guidance to end-users comparing genomes.

| S-EPMC8501649 | biostudies-literature

Alignment-free Transcriptomic and Metatranscriptomic Comparison Using Sequencing Signatures with Variable Length Markov Chains.

Project description:The comparison between microbial sequencing data is critical to understand the dynamics of microbial communities. The alignment-based tools analyzing metagenomic datasets require reference sequences and read alignments. The available alignment-free dissimilarity approaches model the background sequences with Fixed Order Markov Chain (FOMC) yielding promising results for the comparison of microbial communities. However, in FOMC, the number of parameters grows exponentially with the increase of the order of Markov Chain (MC). Under a fixed high order of MC, the parameters might not be accurately estimated owing to the limitation of sequencing depth. In our study, we investigate an alternative to FOMC to model background sequences with the data-driven Variable Length Markov Chain (VLMC) in metatranscriptomic data. The VLMC originally designed for long sequences was extended to apply to high-throughput sequencing reads and the strategies to estimate the corresponding parameters were developed. The flexible number of parameters in VLMC avoids estimating the vast number of parameters of high-order MC under limited sequencing depth. Different from the manual selection in FOMC, VLMC determines the MC order adaptively. Several beta diversity measures based on VLMC were applied to compare the bacterial RNA-Seq and metatranscriptomic datasets. Experiments show that VLMC outperforms FOMC to model the background sequences in transcriptomic and metatranscriptomic samples. A software pipeline is available at https://d2vlmc.codeplex.com.

| S-EPMC5120338 | biostudies-literature

Multilocus association mapping using generalized ridge logistic regression.

Project description:BackgroundIn genome-wide association studies, it is widely accepted that multilocus methods are more powerful than testing single-nucleotide polymorphisms (SNPs) one at a time. Among statistical approaches considering many predictors simultaneously, scan statistics are an effective tool for detecting susceptibility genomic regions and mapping disease genes. In this study, inspired by the idea of scan statistics, we propose a novel sliding window-based method for identifying a parsimonious subset of contiguous SNPs that best predict disease status.ResultsWithin each sliding window, we apply a forward model selection procedure using generalized ridge logistic regression for model fitness in each step. In power simulations, we compare the performance of our method with that of five other methods in current use. Averaging power over all the conditions considered, our method dominates the others. We also present two published datasets where our method is useful in causal SNP identification.ConclusionsOur method can automatically combine genetic information in local genomic regions and allow for linkage disequilibrium between SNPs. It can overcome some defects of the scan statistics approach and will be very promising in genome-wide case-control association studies.

| S-EPMC3224109 | biostudies-literature

Multilocus tetrasomic linkage analysis using hidden Markov chain model.

Project description:The availability of reliable genetic linkage maps is crucial for functional and evolutionary genomic analyses. Established theory and methods of genetic linkage analysis have made map construction a routine exercise in diploids. However, many evolutionarily, ecologically, and/or agronomically important species are autopolyploids, with autotetraploidy being a typical example. These species undergo much more complicated chromosomal segregation and recombination at meiosis than diploids. In addition, there is evidence of polyploidy-induced and highly dynamic changes in the structure of the genome. These polysomic characteristics indicate the inappropriateness of the theory and methods of linkage analysis in diploids for use in these species and a gap in the theory and methodology of tetraploid map construction. This paper presents a theoretical model and statistical framework for multilocus linkage analysis in autotetraploids for use with dominant and/or codominant DNA molecular markers. The theory and methods incorporate the essential features of allele segregation and recombination under tetrasomic inheritance and the major challenges in statistical modeling and marker data analysis. We validated the method and explored its statistical properties by intensive simulation study and demonstrated its utility by analysis of AFLP and SSR marker data from an outbred autotetraploid potato population.

| S-EPMC2840161 | biostudies-literature

Inferring animal densities from tracking data using Markov chains.

Project description:The distributions and relative densities of species are keys to ecology. Large amounts of tracking data are being collected on a wide variety of animal species using several methods, especially electronic tags that record location. These tracking data are effectively used for many purposes, but generally provide biased measures of distribution, because the starts of the tracks are not randomly distributed among the locations used by the animals. We introduce a simple Markov-chain method that produces unbiased measures of relative density from tracking data. The density estimates can be over a geographical grid, and/or relative to environmental measures. The method assumes that the tracked animals are a random subset of the population in respect to how they move through the habitat cells, and that the movements of the animals among the habitat cells form a time-homogenous Markov chain. We illustrate the method using simulated data as well as real data on the movements of sperm whales. The simulations illustrate the bias introduced when the initial tracking locations are not randomly distributed, as well as the lack of bias when the Markov method is used. We believe that this method will be important in giving unbiased estimates of density from the growing corpus of animal tracking data.

| S-EPMC3632542 | biostudies-literature

Improving models for student retention and graduation using Markov chains.

Project description:Graduation rates are a key measure of the long-term efficacy of academic interventions. However, challenges to using traditional estimates of graduation rates for underrepresented students include inherently small sample sizes and high data requirements. Here, we show that a Markov model increases confidence and reduces biases in estimated graduation rates for underrepresented minority and first-generation students. We use a Learning Assistant program to demonstrate the Markov model's strength for assessing program efficacy. We find that Learning Assistants in gateway science courses are associated with a 9% increase in the six-year graduation rate. These gains are larger for underrepresented minority (21%) and first-generation students (18%). Our results indicate that Learning Assistants can improve overall graduation rates and address inequalities in graduation rates for underrepresented students.

| S-EPMC10292706 | biostudies-literature

Stochastic model of Alzheimer's disease progression using two-state Markov chains.

Project description:In 2016, Hao and Friedman developed a deterministic model of Alzheimer's disease progression using a system of partial differential equations. This model describes the general behavior of the disease, however, it does not incorporate the molecular and cellular stochasticity intrinsic to the underlying disease processes. Here we extend the Hao and Friedman model by modeling each event in disease progression as a stochastic Markov process. This model identifies stochasticity in disease progression, as well as changes to the mean dynamics of key agents. We find that the pace of neuron death increases whereas the production of the two key measures of progression, Tau and Amyloid beta proteins, decelerates when stochasticity is incorporated into the model. These results suggest that the non-constant reactions and time-steps have a significant effect on the overall progression of the disease.

| S-EPMC10798450 | biostudies-literature

High capacity DNA data storage with variable-length Oligonucleotides using repeat accumulate code and hybrid mapping.

Project description:BackgroundWith the inherent high density and durable preservation, DNA has been recently recognized as a distinguished medium to store enormous data over millennia. To overcome the limitations existing in a recently reported high-capacity DNA data storage while achieving a competitive information capacity, we are inspired to explore a new coding system that facilitates the practical implementation of DNA data storage with high capacity.ResultIn this work, we devised and implemented a DNA data storage scheme with variable-length oligonucleotides (oligos), where a hybrid DNA mapping scheme that converts digital data to DNA records is introduced. The encoded DNA oligos stores 1.98 bits per nucleotide (bits/nt) on average (approaching the upper bound of 2 bits/nt), while conforming to the biochemical constraints. Beyond that, an oligo-level repeat-accumulate coding scheme is employed for addressing data loss and corruption in the biochemical processes. With a wet-lab experiment, an error-free retrieval of 379.1 KB data with a minimum coverage of 10x is achieved, validating the error resilience of the proposed coding scheme. Along with that, the theoretical analysis shows that the proposed scheme exhibits a net information density (user bits per nucleotide) of 1.67 bits/nt while achieving 91% of the information capacity.ConclusionTo advance towards practical implementations of DNA storage, we proposed and tested a DNA data storage system enabling high potential mapping (bits to nucleotide conversion) scheme and low redundancy but highly efficient error correction code design. The advancement reported would move us closer to achieving a practical high-capacity DNA data storage system.

| S-EPMC6868767 | biostudies-literature

Development of Multimorbidity Over Time: An Analysis of Belgium Primary Care Data Using Markov Chains and Weighted Association Rule Mining.

Project description:BackgroundThe prevalence of multimorbidity is increasing in recent years, and patients with multimorbidity often have a decrease in quality of life and require more health care. The aim of this study was to explore the evolution of multimorbidity taking the sequence of diseases into consideration.MethodsWe used a Belgian database collected by extracting coded parameters and more than 100 chronic conditions from the Electronic Health Records of general practitioners to study patients older than 40 years with multiple diagnoses between 1991 and 2015 (N = 65 939). We applied Markov chains to estimate the probability of developing another condition in the next state after a diagnosis. The results of Weighted Association Rule Mining (WARM) allow us to show strong associations among multiple conditions.ResultsAbout 66.9% of the selected patients had multimorbidity. Conditions with high prevalence, such as hypertension and depressive disorder, were likely to occur after the diagnosis of most conditions. Patterns in several disease groups were apparent based on the results of both Markov chain and WARM, such as musculoskeletal diseases and psychological diseases. Psychological diseases were frequently followed by irritable bowel syndrome.ConclusionsOur study used Markov chains and WARM for the first time to provide a comprehensive view of the relations among 103 chronic conditions, taking sequential chronology into consideration. Some strong associations among specific conditions were detected and the results were consistent with current knowledge in literature, meaning the approaches were valid to be used on larger data sets, such as National Health care Systems or private insurers.

| S-EPMC8202155 | biostudies-literature

Optimizing intra-facility crowding in Wi-Fi environments using continuous-time Markov chains

Project description:Various measures have been devised to reduce crowdedness and alleviate the transmission of COVID-19. In this study, we propose a method for reducing intra-facility crowdedness based on the usage of Wi-Fi networks. We analyze Wi-Fi logs generated continually in vast quantities in the ever-expanding wireless network environment to calculate the transition probabilities between the nodes and the mean stay time at each node. Subsequently, we model this data as a continuous-time Markov chain to determine the variance of the stationary distribution, which is used as a metric of intra-facility crowdedness. Therefore, we solved the optimization problem by using stay rate as a parameter and developed a numerical solution to minimize the intra-facility crowdedness. The optimization results demonstrate that the intra-facility crowding is reduced by approximately 30%. This solution can practically reduce intra-facility crowdedness as it adjusts people’s stay times without making any changes to their movements. We categorized Wi-Fi users into a set of classes using the k-means method and documented the behavioral characteristics of each class to help implement class-specific measures to reduce intra-facility crowdedness, thus enabling facility managers to implement effective countermeasures against crowdedness based on the circumstances. We present a detailed description of our computing environment and workflow used for the basic analysis of vast quantities of Wi-Fi logs. We believe this research will be useful for analysts and facility operators because we have used general-purpose data for analysis.

| S-EPMC9467420 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data