Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7148
Browse
3 results
Search Results
Article Citation - WoS: 16Citation - Scopus: 18Computational and Bioinformatics Methods for Microrna Gene Prediction(Humana Press, 2014) Allmer, JensMicroRNAs (miRNAs) have attracted ever-increasing interest in recent years. Since experimental approaches for determining miRNAs are nontrivial in their application, computational methods for the prediction of miRNAs have gained popularity. Such methods can be grouped into two broad categories (1) performing ab initio predictions of miRNAs from primary sequence alone and (2) additionally employing phylogenetic conservation. Most methods acknowledge the importance of hairpin or stem-loop structures and employ various methods for the prediction of RNA secondary structure. Machine learning has been employed in both categories with classification being the predominant method. In most cases, positive and negative examples are necessary for performing classification. Since it is currently elusive to experimentally determine all possible miRNAs for an organism, true negative examples are hard to come by, and therefore the accuracy assessment of algorithms is hampered. In this chapter, first RNA secondary structure prediction is introduced since it provides a basis for miRNA prediction. This is followed by an assessment of homology and then ab initio miRNA prediction methods.Article Citation - WoS: 37Citation - Scopus: 46Computational Methods for Microrna Target Prediction(Humana Press, 2014) Hamzeiy, Hamid; Yousef, Malik; Allmer, JensMicroRNAs (miRNAs) are important players in gene regulation. The final and maybe the most important step in their regulatory pathway is the targeting. Targeting is the binding of the miRNA to the mature RNA via the RNA-induced silencing complex. Expression patterns of miRNAs are highly specific in respect to external stimuli, developmental stage, or tissue. This is used to diagnose diseases such as cancer in which the expression levels of miRNAs are known to change considerably. Newly identified miRNAs are increasing in number with every new release of miRBase which is the main online database providing miRNA sequences and annotation. Many of these newly identified miRNAs do not yet have identified targets. This is especially the case in animals where the miRNA does not bind to its target as perfectly as it does in plants. Valid targets need to be identified for miRNAs in order to properly understand their role in cellular pathways. Experimental methods for target validations are difficult, expensive, and time consuming. Having considered all these facts it is of crucial importance to have accurate computational miRNA target predictions. There are many proposed methods and algorithms available for predicting targets for miRNAs, but only a few have been developed to become available as independent tools and software. There are also databases which collect and store information regarding predicted miRNA targets. Current approaches to miRNA target prediction produce a huge amount of false positive and an unknown amount of false negative results, and thus the need for better approaches is evermore evident. This chapter aims to give some detail about the current tools and approaches used for miRNA target prediction, provides some grounds for their comparison, and outlines a possible future.Article Citation - Scopus: 1Annealing-Based Model-Free Expectation Maximisation for Multi-Colour Flow Cytometry Data Clustering(Inderscience Enterprises Ltd., 2016) Köktürk, Başak Esin; Karaçalı, BilgeThis paper proposes an optimised model-free expectation maximisation method for automated clustering of high-dimensional datasets. The method is based on a recursive binary division strategy that successively divides an original dataset into distinct clusters. Each binary division is carriedout using a model-free expectation maximisation scheme that exploits the posterior probability computation capability of the quasi-supervised learningalgorithm subjected to a line-search optimisation over the reference set size parameter analogous to a simulated annealing approach. The divisions arecontinued until a division cost exceeds an adaptively determined limit. Experiment results on synthetic as well as real multi-colour flow cytometrydatasets showed that the proposed method can accurately capture the prominent clusters without requiring any prior knowledge on the number of clusters ortheir distribution models.