{"title":"Improving Functional Module Detection","authors":"K. J. Abraham, K. Sameith, F. Falciani","doi":"10.1109/OCCBIO.2009.11","DOIUrl":null,"url":null,"abstract":"There has been a great deal of recent interest in identifying functional modules from protein interaction and gene expression data. One commonly used computational technique is simulated annealing, which while asymptotically correct frequently suffers from slow convergence. In this paper we outline and exploit the analogy between finding functional modules and finding Haplotype Blocks from genetic data, to investigate a new technique for finding functional modules which does not rely on Monte Carlo methodology. We discuss circumstances under which our algorithm may work, but under which simulated annealing may not converge to known modules. We also suggest how our methodology might supplement, and improve the performance, of existing Monte Carlo searches.","PeriodicalId":231499,"journal":{"name":"2009 Ohio Collaborative Conference on Bioinformatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ohio Collaborative Conference on Bioinformatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OCCBIO.2009.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
There has been a great deal of recent interest in identifying functional modules from protein interaction and gene expression data. One commonly used computational technique is simulated annealing, which while asymptotically correct frequently suffers from slow convergence. In this paper we outline and exploit the analogy between finding functional modules and finding Haplotype Blocks from genetic data, to investigate a new technique for finding functional modules which does not rely on Monte Carlo methodology. We discuss circumstances under which our algorithm may work, but under which simulated annealing may not converge to known modules. We also suggest how our methodology might supplement, and improve the performance, of existing Monte Carlo searches.