Resolving Spatial Inconsistencies in Chromosome Conformation Data
We introduce a new method for filtering noisy 3C interactions that selects subsets of interactions that obey metric constraints of various strictness. We demonstrate that, although the problem is computationally hard, near-optimal results are often attainable in practice using well-designed heuristics and approximation algorithms. Further, we show that, compared with a standard technique, this metric filtering approach leads to (a) subgraphs with higher total statistical significance, (b) lower embedding error, (c) lower sensitivity to initial conditions of the embedding algorithm, and (d) structures with better agreement with light microscopy measurements.
Keywordsmetric subgraph chromosome conformation
Unable to display preview. Download preview PDF.
- 5.Gomes, C., Williams, R.: Approximation algorithms. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, ch. 18. Springer (2005)Google Scholar
- 6.Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishing Co, Boston (1997)Google Scholar
- 12.Saxe, J.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: 17th Allerton Conference in Communications, Control and Computing, pp. 480–489 (1979)Google Scholar