An algorithm for finding gene signatures supervised by survival time data

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Signature learning from gene expression consists into selecting a subset of molecular markers which best correlate with prognosis. It can be cast as a feature selection problem. Here we use as optimality criterion the separation between survival curves of clusters induced by the selected features. We address some important problems in this fields such as developing an unbiased search procedure and significance analysis of a set of generated signatures. We apply the proposed procedure to the selection of gene signatures for Non Small Lung Cancer prognosis by using a real data-set. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Pagnotta, S. M., & Ceccarelli, M. (2011). An algorithm for finding gene signatures supervised by survival time data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6881 LNAI, pp. 568–578). https://doi.org/10.1007/978-3-642-23851-2_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free