{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:51:46Z","timestamp":1762390306028},"reference-count":20,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Identification of transcription factor binding sites (TFBSs) plays an important role in deciphering the mechanisms of gene regulation. Recently, GAME, a Genetic Algorithm (GA)-based approach with iterative post-processing, has shown superior performance in TFBS identification. However, the basic GA in GAME is not elaborately designed, and may be trapped in local optima in real problems. The feature operators are only applied in the post-processing, but the final performance heavily depends on the GA output. Hence, both effectiveness and efficiency of the overall algorithm can be improved by introducing more advanced representations and novel operators in the GA, as well as designing the post-processing in an adaptive way.<\/jats:p>\n               <jats:p>Results: We propose a novel framework GALF-P, consisting of Genetic Algorithm with Local Filtering (GALF) and adaptive post-processing techniques (-P), to achieve both effectiveness and efficiency for TFBS identification. GALF combines the position-led and consensus-led representations used separately in current GAs and employs a novel local filtering operator to get rid of false positives within an individual efficiently during the evolutionary process in the GA. Pre-selection is used to maintain diversity and avoid local optima. Post-processing with adaptive adding and removing is developed to handle general cases with arbitrary numbers of instances per sequence. GALF-P shows superior performance to GAME, MEME, BioProspector and BioOptimizer on synthetic datasets with difficult scenarios and real test datasets. GALF-P is also more robust and reliable when further compared with GAME, the current state-of-the-art approach.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/www.cse.cuhk.edu.hk\/~tmchan\/GALFP\/<\/jats:p>\n               <jats:p>Contact: \u00a0tmchan@cse.cuhk.edu.hk<\/jats:p>\n               <jats:p>Supplementary information: Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btm606","type":"journal-article","created":{"date-parts":[[2007,12,8]],"date-time":"2007-12-08T01:24:39Z","timestamp":1197077079000},"page":"341-349","source":"Crossref","is-referenced-by-count":56,"title":["TFBS identification based on genetic algorithm with combined representations and adaptive post-processing"],"prefix":"10.1093","volume":"24","author":[{"given":"Tak-Ming","family":"Chan","sequence":"first","affiliation":[{"name":"Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwong-Sak","family":"Leung","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kin-Hong","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,12,6]]},"reference":[{"key":"2023061011434930000_B1","first-page":"28","article-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers","author":"Bailey","year":"1994"},{"key":"2023061011434930000_B2","first-page":"35","article-title":"Generalized suffix trees for biological sequence data: applications and implementations","author":"Bieganski","year":"1994"},{"key":"2023061011434930000_B3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/1276958.1277037","article-title":"TFBS identification by position- and consensus-led genetic algorithm with local filtering","volume-title":"GECCO '07: Proceedings of the 2007 conference on Genetic and evolutionary computation.","author":"Chan","year":"2007"},{"key":"2023061011434930000_B4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/1068009.1068080","article-title":"MDGA: motif discovery using a genetic algorithm","volume-title":"GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation.","author":"Che","year":"2005"},{"key":"2023061011434930000_B5","doi-asserted-by":"crossref","first-page":"3826","DOI":"10.1093\/nar\/gkh713","article-title":"Discovery of sequence motifs related to coexpression of genes using evolutionary computation","volume":"32","author":"Fogel","year":"2004","journal-title":"Nucleic Acids Res"},{"key":"2023061011434930000_B6","doi-asserted-by":"crossref","first-page":"3157","DOI":"10.1093\/nar\/5.9.3157","article-title":"DNAse footprinting: a simple method for the detection of protein-DNA binding specificity","volume":"5","author":"Galas","year":"1987","journal-title":"Nucleic Acids Res"},{"key":"2023061011434930000_B7","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1093\/nar\/9.13.3047","article-title":"A gel electrophoresis method for quantifying the binding of proteins to specific DNA regions: application to components of the escherichia coli lactose operon regulatory system","volume":"9","author":"Garner","year":"1981","journal-title":"Nucleic Acids Res"},{"key":"2023061011434930000_B8","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1101\/gr.3859605","article-title":"Discovery, validation, and genetic dissection of transcription factor binding sites by comparative and functional genomics","volume":"15","author":"Gertz","year":"2005","journal-title":"Genome Res"},{"key":"2023061011434930000_B9","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1093\/bioinformatics\/bth127","article-title":"BioOptimizer: a Bayesian scoring function approach to motif discovery","volume":"20","author":"Jensen","year":"2004","journal-title":"Bioinformatics"},{"key":"2023061011434930000_B10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","article-title":"Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment","volume":"262","author":"Lawrence","year":"1993","journal-title":"Science"},{"key":"2023061011434930000_B11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jcss.2002.1823","article-title":"Finding similar regions in many sequences","volume":"65","author":"Li","year":"2002","journal-title":"J. Comput. Syst. Sci"},{"key":"2023061011434930000_B12","first-page":"459","article-title":"FMGA: Finding motifs by genetic algorithm","volume-title":"BIBE '04: Proceedings of the 4th IEEE Symposium on Bioinformatics and Bioengineering.","author":"Liu","year":"2004"},{"key":"2023061011434930000_B13","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1080\/01621459.1995.10476622","article-title":"Bayesian models for multiple local sequence alignment and Gibbs sampling strategies","volume":"90","author":"Liu","year":"1995","journal-title":"J. Am. Stat. Assoc"},{"key":"2023061011434930000_B14","first-page":"27","article-title":"Crowding and preselection revisited","volume-title":"Parallel problem solving from nature 2.","author":"Mahfoud","year":"1992"},{"key":"2023061011434930000_B15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/1143997.1144044","article-title":"Identification of weak motifs in multiple biological sequences using genetic algorithm","volume-title":"GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation.","author":"Paul","year":"2006"},{"key":"2023061011434930000_B16","first-page":"144","article-title":"Performance standards and evaluations in ir test collections: cluster-based retrieval models","volume":"33","author":"Shaw","year":"1997","journal-title":"Inf. Process. Manage"},{"key":"2023061011434930000_B17","first-page":"1596","article-title":"Motif discovery in upstream sequences of coordinately expressed genes. In","volume":"3","author":"Stine","year":"2003","journal-title":"CEC '03: Evolutionary Computation, The 2003 Congress on, Vol"},{"key":"2023061011434930000_B18","first-page":"241","article-title":"Computer methods for analyzing sequence recognition of nucleic acids","volume":"17","author":"Stormo","year":"1988","journal-title":"Annu. Rev. BioChem"},{"key":"2023061011434930000_B19","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1093\/bioinformatics\/17.12.1113","article-title":"A higher-order background model improves the detection of promoter regulatory elements by Gibbs sampling","volume":"17","author":"Thijs","year":"2001","journal-title":"Bioinformatics"},{"key":"2023061011434930000_B20","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1093\/bioinformatics\/btl147","article-title":"GAME: detecting cis-regulatory elements using a genetic algorithm","volume":"22","author":"Wei","year":"2006","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/3\/341\/50567963\/bioinformatics_24_3_341.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/3\/341\/50567963\/bioinformatics_24_3_341.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T11:44:50Z","timestamp":1686397490000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/3\/341\/254128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btm606","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,2,1]]},"published":{"date-parts":[[2007,12,6]]}}}