SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Ali Raja Hashim 1985 ) "

Search: WFRF:(Ali Raja Hashim 1985 )

  • Result 1-4 of 4
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Ali, Raja Hashim, 1985-, et al. (author)
  • VMCMC: a graphical and statistical analysis tool for Markov chain Monte Carlo traces
  • Other publication (other academic/artistic)abstract
    • Motivation: MCMC-based methods are important for Bayesian inference of phylogeny and related parameters. Although being computationally expensive, MCMC yields estimates of posterior distributions that are useful for estimating parameter values and are easy to use in subsequent analysis. There are, however, sometimes practical diculties with MCMC, relating to convergence assessment and determining burn-in, especially in large-scale analyses. Currently, multiple software are required to perform, e.g., convergence, mixing and interactive exploration of both continuous and tree parameters.Results: We have written a software called VMCMC to simplify post-processing of MCMC traces with, for example, automatic burn-in estimation. VMCMC can also be used both as a GUI-based application, supporting interactive exploration, and as a command-line tool suitable for automated pipelines. Availability: VMCMC is available for Java SE 6+ under the New BSD License. Executable jar les, tutorial manual and source code can be downloaded from https://bitbucket.org/rhali/visualmcmc/.
  •  
2.
  • Ali, Raja Hashim, 1985-, et al. (author)
  • Burnin estimation and convergence assessment in Bayesian phylogenetic inference
  • Other publication (other academic/artistic)abstract
    •  Convergence assessment and burnin estimation are central concepts in Markov chain Monte Carlo algorithms. Studies on eects, statistical properties, and comparisons between dierent convergence assessment methods have been conducted during the past few decades. However, not much work has been done on the eect of convergence diagnostic on posterior distribution of tree parameters and which method should be used by researchers in Bayesian phylogenetics inference. In this study, we propose and evaluate two novel burnin estimation methods that estimate burnin using all parameters jointly. We also consider some other popular convergence diagnostics, evaluate them in light of parallel chains and quantify the eect of burnin estimates from various convergence diagnostics on the posterior distribution of trees. We motivate the use of convergence diagnostics to assess convergence and estimate burnin in Bayesian phylogenetics inference and found out that it is better to employ convergence diagnostics rather than remove a xed percentage as burnin. We concluded that the last burnin estimator using eective sample size appears to estimate burnin better than all other convergence diagnostics.
  •  
3.
  • Ali, Raja Hashim, 1985- (author)
  • From genomes to post-processing of Bayesian inference of phylogeny
  • 2016
  • Doctoral thesis (other academic/artistic)abstract
    • Life is extremely complex and amazingly diverse; it has taken billions of years of evolution to attain the level of complexity we observe in nature now and ranges from single-celled prokaryotes to multi-cellular human beings. With availability of molecular sequence data, algorithms inferring homology and gene families have emerged and similarity in gene content between two genes has been the major signal utilized for homology inference. Recently there has been a significant rise in number of species with fully sequenced genome, which provides an opportunity to investigate and infer homologs with greater accuracy and in a more informed way. Phylogeny analysis explains the relationship between member genes of a gene family in a simple, graphical and plausible way using a tree representation. Bayesian phylogenetic inference is a probabilistic method used to infer gene phylogenies and posteriors of other evolutionary parameters. Markov chain Monte Carlo (MCMC) algorithm, in particular using Metropolis-Hastings sampling scheme, is the most commonly employed algorithm to determine evolutionary history of genes. There are many softwares available that process results from each MCMC run, and explore the parameter posterior but there is a need for interactive software that can analyse both discrete and real-valued parameters, and which has convergence assessment and burnin estimation diagnostics specifically designed for Bayesian phylogenetic inference.In this thesis, a synteny-aware approach for gene homology inference, called GenFamClust (GFC), is proposed that uses gene content and gene order conservation to infer homology. The feature which distinguishes GFC from earlier homology inference methods is that local synteny has been combined with gene similarity to infer homologs, without inferring homologous regions. GFC was validated for accuracy on a simulated dataset. Gene families were computed by applying clustering algorithms on homologs inferred from GFC, and compared for accuracy, dependence and similarity with gene families inferred from other popular gene family inference methods on a eukaryotic dataset. Gene families in fungi obtained from GFC were evaluated against pillars from Yeast Gene Order Browser. Genome-wide gene families for some eukaryotic species are computed using this approach.Another topic focused in this thesis is the processing of MCMC traces for Bayesian phylogenetics inference. We introduce a new software VMCMC which simplifies post-processing of MCMC traces. VMCMC can be used both as a GUI-based application and as a convenient command-line tool. VMCMC supports interactive exploration, is suitable for automated pipelines and can handle both real-valued and discrete parameters observed in a MCMC trace. We propose and implement joint burnin estimators that are specifically applicable to Bayesian phylogenetics inference. These methods have been compared for similarity with some other popular convergence diagnostics. We show that Bayesian phylogenetic inference and VMCMC can be applied to infer valuable evolutionary information for a biological case – the evolutionary history of FERM domain.
  •  
4.
  • Ali, Raja Hashim, 1985-, et al. (author)
  • GenFamClust : an accurate, synteny-aware and reliable homology inference algorithm
  • 2016
  • In: BMC Evolutionary Biology. - : Springer Science and Business Media LLC. - 1471-2148. ; 16
  • Journal article (peer-reviewed)abstract
    • Background: Homology inference is pivotal to evolutionary biology and is primarily based on significant sequence similarity, which, in general, is a good indicator of homology. Algorithms have also been designed to utilize conservation in gene order as an indication of homologous regions. We have developed GenFamClust, a method based on quantification of both gene order conservation and sequence similarity. Results: In this study, we validate GenFamClust by comparing it to well known homology inference algorithms on a synthetic dataset. We applied several popular clustering algorithms on homologs inferred by GenFamClust and other algorithms on a metazoan dataset and studied the outcomes. Accuracy, similarity, dependence, and other characteristics were investigated for gene families yielded by the clustering algorithms. GenFamClust was also applied to genes from a set of complete fungal genomes and gene families were inferred using clustering. The resulting gene families were compared with a manually curated gold standard of pillars from the Yeast Gene Order Browser. We found that the gene-order component of GenFamClust is simple, yet biologically realistic, and captures local synteny information for homologs. Conclusions: The study shows that GenFamClust is a more accurate, informed, and comprehensive pipeline to infer homologs and gene families than other commonly used homology and gene-family inference methods.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-4 of 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view