Finding occurrences of protein complexes in protein-protein interaction graphs

DOI10.1016/J.JDA.2008.11.003MaRDI QIDQ1013075zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Romeo Rizzi, Stéphane Vialette

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

approximation algorithmcomputational biologycomputational complexityparameterized complexityprotein-protein interaction graph

Mathematics Subject Classification ID

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

Recommendations

• Mathematical Foundations of Computer Science 2005
• Pattern Matching in Protein-Protein Interaction Graphs
• Complexity issues in color-preserving graph embeddings
• Quasi-bicliques: Complexity and Binding Pairs
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs

Cites work

• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• Covering and packing in graphs IV: Linear arboricity
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2087047 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• Optimization, approximation, and complexity classes
• Pattern matching for arc-annotated sequences
• Pattern Matching in Protein-Protein Interaction Graphs
• Research in Computational Molecular Biology
• The linear arboricity of graphs

Cited in

(3)

• Pattern Matching in Protein-Protein Interaction Graphs
• Mathematical Foundations of Computer Science 2005
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013075)