@inproceedings{1ad7dcc9389c490183cffa84adef7009,
title = "Sharp tractability borderlines for finding connected motifs in vertex-colored graphs",
abstract = "We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices whose multiset of colors equals the motif. This problem has applications in metabolic network analysis, an important area in bioinformatics. We give two positive results and three negative results that together draw sharp borderlines between tractable and intractable instances of the problem.",
author = "Fellows, {Michael R.} and Guillaume Fertin and Danny Hermelin and St{\'e}phane Vialette",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-73420-8_31",
language = "English",
isbn = "3540734198",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "340--351",
booktitle = "Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings",
address = "Germany",
note = "34th International Colloquium on Automata, Languages and Programming, ICALP 2007 ; Conference date: 09-07-2007 Through 13-07-2007",
}