Show simple item record

dc.contributor.authorKapur, Arnav
dc.contributor.authorMarwah, Kshitij
dc.contributor.authorAlterovitz, Gil
dc.date.accessioned2016-08-26T18:57:23Z
dc.date.available2016-08-26T18:57:23Z
dc.date.issued2016-06
dc.date.submitted2015-11
dc.identifier.issn1471-2105
dc.identifier.urihttp://hdl.handle.net/1721.1/104048
dc.description.abstractBackground An exponential growth of high-throughput biological information and data has occurred in the past decade, supported by technologies, such as microarrays and RNA-Seq. Most data generated using such methods are used to encode large amounts of rich information, and determine diagnostic and prognostic biomarkers. Although data storage costs have reduced, process of capturing data using aforementioned technologies is still expensive. Moreover, the time required for the assay, from sample preparation to raw value measurement is excessive (in the order of days). There is an opportunity to reduce both the cost and time for generating such expression datasets. Results We propose a framework in which complete gene expression values can be reliably predicted in-silico from partial measurements. This is achieved by modelling expression data as a low-rank matrix and then applying recently discovered techniques of matrix completion by using nonlinear convex optimisation. We evaluated prediction of gene expression data based on 133 studies, sourced from a combined total of 10,921 samples. It is shown that such datasets can be constructed with a low relative error even at high missing value rates (>50 %), and that such predicted datasets can be reliably used as surrogates for further analysis. Conclusion This method has potentially far-reaching applications including how bio-medical data is sourced and generated, and transcriptomic prediction by optimisation. We show that gene expression data can be computationally constructed, thereby potentially reducing the costs of gene expression profiling. In conclusion, this method shows great promise of opening new avenues in research on low-rank matrix completion in biological sciences.en_US
dc.publisherBioMed Centralen_US
dc.relation.isversionofhttp://dx.doi.org/10.1186/s12859-016-1106-6en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.sourceBioMed Centralen_US
dc.titleGene expression prediction using low-rank matrix completionen_US
dc.typeArticleen_US
dc.identifier.citationKapur, Arnav, Kshitij Marwah, and Gil Alterovitz. “Gene Expression Prediction Using Low-Rank Matrix Completion.” BMC Bioinformatics 17.1 (2016): n. pag.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.mitauthorAlterovitz, Gilen_US
dc.relation.journalBMC Bioinformaticsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2016-08-03T08:14:04Z
dc.language.rfc3066en
dc.rights.holderKapur et al.
dspace.orderedauthorsKapur, Arnav; Marwah, Kshitij; Alterovitz, Gilen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-5952-9844
mit.licensePUBLISHER_CCen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record