Connectivity inference in mass spectrometry based structure determination
DOI10.1007/978-3-642-40450-4_25zbMATH Open1394.68434OpenAlexW125066187MaRDI QIDQ2849320FDOQ2849320
Authors: Deepesh Agarwal, Júlio Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes 
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00837496/file/RR-8320-MCI.pdf
Recommendations
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- A computational study of reduction techniques for the minimum connectivity inference problem
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Clique-detection models in computational biochemistry and genomics
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Connectivity (05C40) Biophysics (92C05)
Cited In (4)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- A computational study of reduction techniques for the minimum connectivity inference problem
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Placing green bridges optimally, with a multivariate analysis
This page was built for publication: Connectivity inference in mass spectrometry based structure determination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849320)
