Skip to main content
SpringerLink
Log in

Finding and Counting Vertex-Colored Subtrees

  • Conference paper
Mathematical Foundations of Computer Science 2010 (MFCS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6281))

Abstract

The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. [17] in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a given multiset of colors M. Using an algebraic framework recently introduced by Koutis et al. [15,16], we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, showing that the counting problem is FPT if M is a set, but becomes # W [1]-hard if M is a multiset with two colors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alm, E., Arkin, A.P.: Biological networks. Curr. Opin. Struct. Biol. 13(2), 193–202 (2003)

    Article  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. of ACM 42(4), 844–856 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Betzler, N., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 31–43. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: STOC, pp. 67–74 (2007)

    Google Scholar 

  5. Blin, G., Sikora, F., Vialette, S.: GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. In: BICoB 2010, pp. 38–43 (2010)

    Google Scholar 

  6. Böcker, S., Rasche, F., Steijger, T.: Annotating Fragmentation Patterns. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS (LNBI), vol. 5724, pp. 13–24. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Bruckner, S., Hüffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-Free Querying of Protein Interaction Networks. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 74–89. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Dondi, R., Fertin, G., Vialette, S.: Weak pattern matching in colored graphs: Minimizing the number of connected components. In: ICTCS, pp. 27–38 (2007)

    Google Scholar 

  9. Dondi, R., Fertin, G., Vialette, S.: Maximum Motif Problem in Vertex-Colored Graphs. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 221–235. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 340–351. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Flum, J., Grohe, M.: The Parameterized Complexity of Counting Problems. SIAM Journal on Computing 33(4), 892–922 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    Google Scholar 

  13. Hüffner, F., Wernicke, S., Zichner, T.: Algorithm Engineering For Color-Coding To Facilitate Signaling Pathway Detection. In: APBC 2007, pp. 277–286 (2007)

    Google Scholar 

  14. Karp, R.M.: Dynamic-programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1, 49–51 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Koutis, I.: Faster Algebraic Algorithms for Path and Packing Problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575–586. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., et al. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 653–664. Springer, Heidelberg (2009)

    Google Scholar 

  17. Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif Search in Graphs: Application to Metabolic Networks. Trans. Comput. Biol. Bioinform. 3(4), 360–368 (2006)

    Article  Google Scholar 

  18. Nederlof, J.: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 713–725. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Schbath, S., Lacroix, V., Sagot, M.-F.: Assessing the exceptionality of coloured motifs in networks. In: EURASIP JBSB, pp. 1–9 (2009)

    Google Scholar 

  20. Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nature Biotechnology 24, 427–433 (2006)

    Article  Google Scholar 

  21. Williams, R.: Finding paths of length k in O *(2k) time. IPL 109(6), 315–318 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Bioinformatik, Friedrich-Schiller Universität Jena, Ernst-Abbe Platz 2, 00743, Jena, Germany

    Sylvain Guillemot

  2. Université Paris-Est, LIGM - UMR CNRS, 8049, France

    Florian Sikora

Authors
  1. Sylvain Guillemot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florian Sikora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Falculty of Informatics, Masaryk University, Botanicka 68a, 602 00, Brno, Czech Republic

    Petr Hliněný

  2. Faculty of Informatics, Masaryk University, Botanicka 68a, 602 00, Brno, Czech Republic

    Antonín Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guillemot, S., Sikora, F. (2010). Finding and Counting Vertex-Colored Subtrees. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15155-2_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15154-5

  • Online ISBN: 978-3-642-15155-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation