Error propagation in sparse linear systems with peptide-protein incidence matrices
Paper i proceeding, 2012

We study the additive errors in solutions to systems Ax=b of linear equations where vector b is corrupted, with a focus on systems where A is a 0,1-matrix with very sparse rows. We give a worst-case error bound in terms of an auxiliary LP, as well as graph-theoretic characterizations of the optimum of this error bound in the case of two variables per row. The LP solution indicates which measurements should be combined to minimize the additive error of any chosen variable. The results are applied to the problem of inferring the amounts of proteins in a mixture, given inaccurate measurements of the amounts of peptides after enzymatic digestion. Results on simulated data (but from real proteins split by trypsin) suggest that the errors of most variables blow up by very small factors only.

shortest path

linear system

error propagation

bipartite graph

protein mixture inference

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Leonid Molokov

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 7292 72-83

Fundament

Grundläggande vetenskaper

Styrkeområden

Livsvetenskaper och teknik

Ämneskategorier

Datavetenskap (datalogi)

ISBN

978-3-642-30190-2