Partial information network queries

DOI10.1016/J.JDA.2014.11.007MaRDI QIDQ2018546zbMATH OpenOpenAlexFDO

Authors Hadas Shachnai, Meirav Zehavi, Ron Y. Pinter

Publication date 24 March 2015

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.11.007

zbMATH Keywords

pattern matchingparameterized algorithmalignment network querypartial information network querytopology-free network query

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Systems biology, networks (92C42)

Recommendations

• Partial information network queries
• Improved parameterized algorithms for network query problems
• Improved parameterized algorithms for network query problems
• Algorithms for topology-free and alignment network queries
• Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Algorithm engineering for color-coding with applications to signaling pathway detection
• Algorithms for topology-free and alignment network queries
• Approximate labelled subtree homeomorphism
• Color-coding
• Constrained multilinear detection for faster functional motif discovery
• Faster Algebraic Algorithms for Path and Packing Problems
• Finding and counting vertex-colored subtrees
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Narrow sieves for parameterized paths and packings
• On the Kernelization Complexity of Colorful Motifs
• Parameterized algorithms for module motif
• Partial information network queries
• Probably optimal graph motifs
• Randomized divide-and-conquer: improved path, matching, and packing algorithms
• Some results on more flexible versions of Graph Motif
• Upper and lower bounds for finding connected motifs in vertex-colored graphs

Cited in

(5)

• Partial information network queries
• Improved parameterized algorithms for network query problems
• Deterministic parameterized algorithms for the graph motif problem
• Improved parameterized algorithms for network query problems
• Algorithms for topology-free and alignment network queries

Describes a project that uses

Uses Software

• QPath
• QNet

This page was built for publication: Partial information network queries

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