Pages that link to "Item:Q5706853"
From MaRDI portal
The following pages link to Research in Computational Molecular Biology (Q5706853):
Displayed 15 items.
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Integration of topological measures for eliminating non-specific interactions in protein interaction networks (Q1026211) (← links)
- Refining cellular pathway models using an ensemble of heterogeneous data sources (Q1620980) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- A linear programming model based on network flow for pathway inference (Q2429909) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
- Determination of Glycan Structure from Tandem Mass Spectra (Q5323072) (← links)