Effect of using varying negative examples in transcription factor binding site predictions
Effect of using varying negative examples in transcription factor binding site predictions
Identifying transcription factor binding sites computationally is a hard problem as it produces many false predictions. Combining the predictions from existing predictors can improve the overall predictions by using classification methods like Support Vector Machines (SVM). But conventional negative examples (that is, example of non-binding sites) in this type of problem are highly unreliable. In this study, we have used different types of negative examples. One class of the negative examples has been taken from far away from the promoter regions, where the occurrence of binding sites is very low, and another one has been produced by randomization. Thus we observed the effect of using different negative examples in predicting transcription factor binding sites in mouse. We have also devised a novel cross-validation technique for this type of biological problem.
1-12
Rezwan, Faisal
203f8f38-1f5d-485b-ab11-c546b4276338
Sun, Yi
52b4df91-6eec-4c04-8106-7cd195f1d0a6
Davey, Neil
45038a2a-60fa-475b-be2b-72b23c97bb0c
Adams, Rod
aba52023-234f-464a-b86f-504b200dc950
Rust, Alistair G.
27e6975d-abef-4037-a8ff-74b2a18cb687
Robinson, Mark
0191ef40-12cc-4b4d-9bcd-5547087add95
2011
Rezwan, Faisal
203f8f38-1f5d-485b-ab11-c546b4276338
Sun, Yi
52b4df91-6eec-4c04-8106-7cd195f1d0a6
Davey, Neil
45038a2a-60fa-475b-be2b-72b23c97bb0c
Adams, Rod
aba52023-234f-464a-b86f-504b200dc950
Rust, Alistair G.
27e6975d-abef-4037-a8ff-74b2a18cb687
Robinson, Mark
0191ef40-12cc-4b4d-9bcd-5547087add95
Rezwan, Faisal, Sun, Yi, Davey, Neil, Adams, Rod, Rust, Alistair G. and Robinson, Mark
(2011)
Effect of using varying negative examples in transcription factor binding site predictions.
In Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics - 9th European Conference, EvoBIO 2011, Proceedings.
vol. 6623 LNCS,
.
(doi:10.1007/978-3-642-20389-3_1).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Identifying transcription factor binding sites computationally is a hard problem as it produces many false predictions. Combining the predictions from existing predictors can improve the overall predictions by using classification methods like Support Vector Machines (SVM). But conventional negative examples (that is, example of non-binding sites) in this type of problem are highly unreliable. In this study, we have used different types of negative examples. One class of the negative examples has been taken from far away from the promoter regions, where the occurrence of binding sites is very low, and another one has been produced by randomization. Thus we observed the effect of using different negative examples in predicting transcription factor binding sites in mouse. We have also devised a novel cross-validation technique for this type of biological problem.
This record has no associated files available for download.
More information
Published date: 2011
Venue - Dates:
9th European Conference on Evolutionary Computation, Machine Learning, and Data Mining in Bioinformatics, EvoBIO 2011, , Torino, Italy, 2011-04-27 - 2011-04-29
Identifiers
Local EPrints ID: 414016
URI: http://eprints.soton.ac.uk/id/eprint/414016
ISSN: 03029743
PURE UUID: 7068b69f-57c6-4dbb-bb06-49361c8eafb1
Catalogue record
Date deposited: 12 Sep 2017 16:31
Last modified: 06 Jun 2024 01:51
Export record
Altmetrics
Contributors
Author:
Faisal Rezwan
Author:
Yi Sun
Author:
Neil Davey
Author:
Rod Adams
Author:
Alistair G. Rust
Author:
Mark Robinson
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics