Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3275

Title: Can graph-cutting improve microarray gene expression reconstructions?
Authors: Fraser, K
Wang, Z
Li, Y
Kellam, P
Liu, X
Keywords: cDNA; Two channel; Microarrays; Background reconstruction; Graph-edge cuts
Publication Date: 2008
Publisher: Elsevier
Citation: Pattern Recognition Letters. 29(16): 2129-2136
Abstract: Microarrays produce high-resolution image data that are, unfortunately, permeated with a great deal of “noise” that must be removed for precision purposes. This paper presents a technique for such a removal process. On completion of this non-trivial task, a new surface (devoid of gene spots) is subtracted from the original to render more precise gene expressions. The graph-cutting technique as implemented has the benefits that only the most appropriate pixels are replaced and these replacements are replicates rather than estimates. This means the influence of outliers and other artifacts are handled more appropriately (than in previous methods) as well as the variability of the final gene expressions being considerably reduced. Experiments are carried out to test the technique against commercial and previously researched reconstruction methods. Final results show that the graph-cutting inspired identification mechanism has a positive significant impact on reconstruction accuracy.
URI: http://www.elsevier.com/wps/find/ journaldescription.cws_home/505619/description#description
http://bura.brunel.ac.uk/handle/2438/3275
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Can Graph cutting improve microarray gene.pdf887.99 kBAdobe PDFView/Open

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