Recommendations
Cites work
- A fast new DES implementation in software
- Algorithms for topology-free and alignment network queries
- Binary jumbled pattern matching on trees and tree-like structures
- Color-coding
- Constrained multilinear detection and generalized graph motifs
- Constrained multilinear detection for faster functional motif discovery
- Determinant sums for undirected Hamiltonicity
- Deterministic parameterized algorithms for the graph motif problem
- Engineering Motif Search for Large Graphs
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Faster Algebraic Algorithms for Path and Packing Problems
- Finding and counting vertex-colored subtrees
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- scientific article; zbMATH DE number 1878332 (Why is no real title available?)
- Maximum Motif Problem in Vertex-Colored Graphs
- Narrow sieves for parameterized paths and packings
- New algorithms for binary jumbled pattern matching
- Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
- Parameterized algorithms
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
- Parameterized algorithms for module motif
- Parameterized algorithms for the module motif problem
- Partial information network queries
- Tensor Decompositions and Applications
- The graph motif problem parameterized by the structure of the input graph
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
Cited in
(2)
This page was built for publication: Engineering motif search for large motifs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140739)
