Finding occurrences of protein complexes in protein-protein interaction graphs
type: Item
instance of: scholarly article
title: Finding occurrences of protein complexes in protein-protein interaction graphs
zbMATH Open document ID: 1162.92015
author: Guillaume Fertin
author: Romeo Rizzi
author: Stéphane Vialette
published in: Journal of Discrete Algorithms
publication date: 2009-04-16T00:00:00Z
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5544363
zbMATH Keywords: computational biology
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation algorithm
zbMATH Keywords: parameterized complexity
zbMATH Keywords: protein-protein interaction graph
MaRDI profile type: Publication
full work available at URL: j.jda.2008.11.003
OpenAlex ID: W2057965339
cites work: Covering and packing in graphs IV: Linear arboricity
cites work: Q4737693
cites work: The linear arboricity of graphs
cites work: Q4004078
cites work: Pattern Matching in Protein-Protein Interaction Graphs
cites work: Q4393480
cites work: Q4074927
cites work: Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
cites work: Mathematical Foundations of Computer Science 2005
cites work: Q4198056
cites work: Pattern matching for arc-annotated sequences
cites work: Research in Computational Molecular Biology
cites work: Optimization, approximation, and complexity classes
DOI: 10.1016/J.JDA.2008.11.003
description: scientific article; zbMATH DE number 5544363