{"title":"Tackling the challenging motif problem through hybrid particle swarm optimized alignment clustering","authors":"Chengpeng Bi","doi":"10.1109/CIBCB.2011.5948452","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948452","url":null,"abstract":"Previous studies show that Gibbs sampling methods and the like desperately failed to solve the challenging motif problem. This paper proposes a new hybrid algorithm, integrated Gibbs with particle swarm optimization (PSO) based motif alignment clustering (PSO-MAC), to solve the challenging motif problem by iteratively refining a population of potential solutions. The PSO-MAC algorithm is closely incorporated into a variant Gibbs called pseudo-Gibbs (pGibbs) motif sampler. Notably, pGibbs as a forerunner is executed multiple times and hence it brings about a population of potential alignments. Then, a PSO procedure coupled with motif alignment clustering (MAC) is developed to fine-tune such a population of solutions. The hybrid PSO-MAC algorithm aims to glean high quality motif solutions by cyclically refining and clustering the solution pool. Simulation and experimental results show that the new hybrid algorithm performs markedly better than others tested, and surprisingly it is able to solve the challenging motif problem with high precision. The new hybrid algorithm is also successfully applied to large-scale ChIP-Seq data sets.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving the transparency in fuzzy modelling of radiotherapy margins in cancer treatment","authors":"B. Mzenda, David J. Brown, A. Gegov","doi":"10.1109/CIBCB.2011.5948453","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948453","url":null,"abstract":"This study introduces the novel application of a fuzzy network concept to derive optimal margins for use in the treatment of cancer using external beam radiotherapy. The input data for the model is based on the effects of treatment errors, in terms of delineation, organ motion and patient set-up errors, on tumour coverage and doses to critical organs. A demonstrable improvement in the model transparency is shown by application of the fuzzy network compared to a conventional fuzzy system, whilst the model accuracy is also improved.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"138 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113992482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ROAR: A Reference Ontology for Anatomical Relations","authors":"Alton B. Coalter, J. Leopold","doi":"10.1109/CIBCB.2011.5948470","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948470","url":null,"abstract":"The ontology has become a useful model for organizing knowledge. This is particularly true in the field of biomedicine, where individual ontologies have been created for specific data domains ranging from genomics through species morphologies to human anatomical reference ontologies. Although specific sets of relationships have been proposed to improve the accuracy and consistency of such ontologies, there has been little to nothing proposed concerning the organization of those relationships. To help address this deficiency, herein we present a Reference Ontology of Anatomical Relations (ROAR). ROAR extends the concepts used in existing biomedical ontologies by defining and hierarchically organizing temporal, spatial, functional, and taxonomic relations based on generalization/specialization and semantic relatedness. Also provided in this paper are examples of how the use of such a reference ontology would significantly increase the ease with which data from multiple ontologies could be developed and integrated and would improve the information base for other computational intelligence activities.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing the Salmon Algorithm for the construction of DNA error-correcting codes","authors":"John Orth, S. Houghten","doi":"10.1109/CIBCB.2011.5948476","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948476","url":null,"abstract":"DNA error correcting codes over the edit metric can be used to correct sequencing errors. The codewords may be used as embeddable markers that allow one to track the origin of sequence data. The Salmon Algorithm is a search meta-heuristic inspired by the behaviour of salmon swimming upstream to spawn. This algorithm consists of a number of parameters, which we tune for the purpose of constructing DNA error correcting codes with a large number of codewords. Using this algorithm, several best known code sizes are improved. Construction of codes obeying biological restrictions is also discussed and the use of the Salmon Algorithm for this purpose is demonstrated.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126774381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Utilization of gene ontology in semi-supervised clustering","authors":"D. D. Doan, Yunli Wang, Youlian Pan","doi":"10.1109/CIBCB.2011.5948467","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948467","url":null,"abstract":"Semi-supervised clustering incorporating biological relevance as a prior knowledge has been favored over the past decade. However, selection of prior knowledge has been a challenge. We generate prior knowledge from Gene Ontology (GO) terms at different levels of GO hierarchy and use them to study their impact on the performance of subsequent clustering of microarray data by using MPCKMeans and GOFuzzy. We evaluate the performance by F-measure and the number of specific GO terms and transcription factors. The clustering result with prior knowledge generated from lower levels of GO hierarchy have higher F-measure and more number of specific GO terms and transcription factors. MPCKMeans with prior knowledge generated from multiple levels in the GO hierarchy outperforms GOFuzzy with prior knowledge from the first level in the GO hierarchy. A small amount (1–2%) of prior knowledge can improve semi-supervised clustering result substantially and the more specific prior knowledge is generally more efficient in guiding the semi-supervised clustering process.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secondary structure element voting for RNA gene finding","authors":"N. Erho, K. Wiese","doi":"10.1109/CIBCB.2011.5948477","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948477","url":null,"abstract":"An exploration of the use of multiple secondary structure elements for structural RNA gene finding is conducted. The secondary structure models are combined through a multilayer voting system which first combines the probability output of support vector machines and then combines the results of those votes to predict whether a sequence is a structural RNA gene or not. It is found that the voting in the first layer of the system has significant impact on the performance of individual secondary structure element models with improvements in classification results of up to 56%. Likewise, gains in classification F-measure over 0.6 were seen when two secondary structure element model predictions were voted together. When all the secondary structure element models were used in voting, an accuracy of over 93% was achieved by the secondary structure RNA gene classification system.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116839122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized operators and its application to a nonlinear fuzzy clustering model","authors":"M. Sato-Ilic","doi":"10.1109/CIBCB.2011.5948471","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948471","url":null,"abstract":"In this paper, a generalized operator based nonlinear fuzzy clustering model is proposed. Target data of this model is similarity data and the obtained similarity data has various structures. Therefore, for general-purpose, the generalized operators are defined on a product space of linear spaces in order to consider the variety of the structures of similarity between a pair of objects by revising the aggregation operators from the binary operator to a function on a product space. Ị umerical examples using artificial data and diagnostic breast cancer data show the potential utility of the general-purpose model and better performance when compared with an ordinary nonlinear fuzzy clustering model such as a kernel fuzzy clustering model.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125529063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Illumination field estimation through background detection in optical microscopy","authors":"A. Gherardi, A. Bevilacqua, F. Piccinini","doi":"10.1109/CIBCB.2011.5948457","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948457","url":null,"abstract":"Automated microscopic image analysis techniques are increasingly gaining attention in the field of biological imaging. The success of these applications mostly depends on the earlier image processing steps applied to the acquired images, aiming at enhancing image content while performing noise and artifacts removal. One such artifact is the vignetting effect that in general occurs in most imaging sensors due to an uneven illumination of the scene being imaged. As a consequence, images are usually lighter near the optical center and darker at image borders. This effect is particularly evident when stitching images into a mosaic in order to increase the field of view of the microscope. The existing approaches deal with either the parametric model of the known light distribution or the estimation of the illumination field based on just one image or a sequence of empty-field images. These approaches are only feasible when the acquisition apparatus is at one's disposal. We propose a non parametric and general purpose approach, without using prior information about the light distribution, where the illumination field is estimated from the background, that is built automatically stemming from a sequence of images containing even the objects of interest.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121333198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A comparison of Finite State Classifier and Mahalanobis-Taguchi System for multivariate pattern recognition in skin cancer detection","authors":"E. Cudney, S. Corns","doi":"10.1109/CIBCB.2011.5948469","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948469","url":null,"abstract":"This project presents two methods for image classification for the detection of malignant melanoma: the Mahalanobis-Taguchi System and Finite State Classifiers. The Mahalanobis-Taguchi System is a diagnosis and predictive method for analyzing patterns in multivariate cases, while Finite State Classifiers are a state based machine learning technique. The goal of this study is to compare the ability of the Mahalanobis-Taguchi System and a Finite State Classifier to discriminate using small data sets. We examine the discriminant ability as a function of data set size using publicly available skin lesion image data. While analysis of the data shows a high degree of correlation, the Mahalanobis-Taguchi System performed poorly when trying to discriminate between Malignant Melanoma and benign lesions. Alternately, the Finite State Classifiers developed using evolutionary computation obtained over 85% correct classification of the malignant and benign lesions using the image data sets.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reverse engineering of gene regulatory networks: A systems approach","authors":"Zhen Wang, P. Mousavi","doi":"10.1109/CIBCB.2011.5948475","DOIUrl":"https://doi.org/10.1109/CIBCB.2011.5948475","url":null,"abstract":"In the last decade many computational approaches have been introduced to model networks of molecular interactions from gene expression data. Such networks can provide an understanding of the regulatory mechanisms in the cells. System identification algorithms refer to a group of approaches that capture the dynamic relationship between the input and output of a system, and provide a deterministic model of its function. These approaches have been extensively developed for engineering systems, and have reasonable computational requirements. In this paper, we present two system identification methods applied to reverse engineering of gene regulatory networks. Gene regulatory networks are constructed as systems where the output to be estimated is an expression profile of a gene, and the inputs are the potential regulators of that gene. The first reverse engineering method is based on orthogonal search and selects terms from a predefined set of gene expression profiles to best fit the expression levels of a given output gene. The second method consists of multiple cascade models; each cascade includes a dynamic component and a static component. Several cascades are used in parallel to reduce the difference of the estimated expression profiles with the actual ones. To assess the performance of the proposed methods, they are applied to a temporal synthetic dataset, a simulated gene expression time series of songbird brain, and yeast Saccharomyces Cerevisiae cell cycle. Results are compared to known mechanisms of the underlying data and the literature, and demonstrate that the proposed approaches capture the underlying interactions as networks.","PeriodicalId":395505,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124415936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}