Finding occurrences of protein complexes in protein-protein interaction graphs

DOI10.1016/j.jda.2008.11.003zbMath1162.92015OpenAlexW2057965339MaRDI QIDQ1013075

Stéphane Vialette, Guillaume Fertin, Romeo Rizzi

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.11.003

zbMATH Keywords

computational complexityapproximation algorithmcomputational biologyparameterized complexityprotein-protein interaction graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the ordered list subgraph embedding problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• The linear arboricity of graphs
• Optimization, approximation, and complexity classes
• Pattern matching for arc-annotated sequences
• Covering and packing in graphs IV: Linear arboricity
• Pattern Matching in Protein-Protein Interaction Graphs
• Mathematical Foundations of Computer Science 2005
• Research in Computational Molecular Biology

This page was built for publication: Finding occurrences of protein complexes in protein-protein interaction graphs