Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.92317OpenAlexW2494705596MaRDI QIDQ5492869FDOQ5492869

Authors: Guillaume Fertin, Romeo Rizzi, Stéphane Vialette 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Finding occurrences of protein complexes in protein-protein interaction graphs
• Pattern Matching in Protein-Protein Interaction Graphs
• Complexity issues in color-preserving graph embeddings
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• Maximum Motif Problem in Vertex-Colored Graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• Pattern Matching in Protein-Protein Interaction Graphs
• Complexity issues in color-preserving graph embeddings
• The complexity of locally injective homomorphisms
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• Finding occurrences of protein complexes in protein-protein interaction graphs
• Obstructions to locally injective oriented improper colourings
• Obstructions to injective oriented colourings

This page was built for publication: Mathematical Foundations of Computer Science 2005

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