Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-30191-9_7 | ISBRA |
Keywords | Field | DocType |
sparse linear system,enzymatic digestion,worst-case error,chosen variable,graph-theoretic characterization,linear equation,systems ax,inaccurate measurement,lp solution,peptide-protein incidence matrix,additive error,error propagation,auxiliary lp,shortest path,bipartite graph,linear system | Row,Linear equation,Propagation of uncertainty,Linear system,Shortest path problem,Matrix (mathematics),Peptide,Bipartite graph,Artificial intelligence,Machine learning,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Damaschke | 1 | 471 | 56.99 |
| Leonid Molokov | 2 | 18 | 2.66 |