Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/6874
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSandve, Geir Kjetil-
dc.contributor.authorAbul, Osman-
dc.contributor.authorWalseng, Vegard-
dc.contributor.authorDrablos, Finn-
dc.date.accessioned2021-09-11T15:44:01Z-
dc.date.available2021-09-11T15:44:01Z-
dc.date.issued2007en_US
dc.identifier.issn1471-2105-
dc.identifier.urihttps://doi.org/10.1186/1471-2105-8-193-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/6874-
dc.description.abstractBackground: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods have been proposed, and it is difficult to make an informed choice. Therefore, robust assessment of motif discovery methods becomes important, both for validation of existing tools and for identification of promising directions for future research. Results: We use a machine learning perspective to analyze collections of transcription factors with known binding sites. Algorithms are presented for finding position weight matrices (PWMs), IUPAC-type motifs and mismatch motifs with optimal discrimination of binding sites from remaining sequence. We show that for many data sets in a recently proposed benchmark suite for motif discovery, none of the common motif models can accurately discriminate the binding sites from remaining sequence. This may obscure the distinction between the potential performance of the motif discovery tool itself versus the intrinsic complexity of the problem we are trying to solve. Synthetic data sets may avoid this problem, but we show on some previously proposed benchmarks that there may be a strong bias towards a presupposed motif model. We also propose a new approach to benchmark data set construction. This approach is based on collections of binding site fragments that are ranked according to the optimal level of discrimination achieved with our algorithms. This allows us to select subsets with specific properties. We present one benchmark suite with data sets that allow good discrimination between positive and negative instances with the common motif models. These data sets are suitable for evaluating algorithms for motif discovery that rely on these models. We present another benchmark suite where PWM, IUPAC and mismatch motif models are not able to discriminate reliably between positive and negative instances. This suite could be used for evaluating more powerful motif models. Conclusion: Our improved benchmark suites have been designed to differentiate between the performance of motif discovery algorithms and the power of motif models. We provide a web server where users can download our benchmark suites, submit predictions and visualize scores on the benchmarks.en_US
dc.language.isoenen_US
dc.publisherBmcen_US
dc.relation.ispartofBmc Bioinformaticsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subject[No Keywords]en_US
dc.titleImproved Benchmarks for Computational Motif Discoveryen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümütr_TR
dc.identifier.volume8en_US
dc.authorid0000-0001-5794-828X-
dc.authorid0000-0002-4959-1409-
dc.identifier.wosWOS:000247791600002en_US
dc.identifier.scopus2-s2.0-34347339593en_US
dc.institutionauthorAbul, Osman-
dc.identifier.pmid17559676en_US
dc.identifier.doi10.1186/1471-2105-8-193-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.dept02.3. Department of Computer Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
PubMed İndeksli Yayınlar Koleksiyonu / PubMed Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

50
checked on Dec 21, 2024

WEB OF SCIENCETM
Citations

51
checked on Oct 5, 2024

Page view(s)

104
checked on Dec 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.