Research in Computational Molecular Biology

DOI10.1007/b135594zbMath1119.92331OpenAlexW4376539797MaRDI QIDQ5706853

No author found.

Publication date: 23 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135594

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items

Refining cellular pathway models using an ensemble of heterogeneous data sources ⋮ Kernel Bounds for Path and Cycle Problems ⋮ Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set ⋮ Determination of Glycan Structure from Tandem Mass Spectra ⋮ Finding approximate and constrained motifs in graphs ⋮ A linear programming model based on network flow for pathway inference ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ Algorithmic Aspects of the Maximum Colorful Arborescence Problem ⋮ Finding Approximate and Constrained Motifs in Graphs ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Maximum Motif Problem in Vertex-Colored Graphs ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Integration of topological measures for eliminating non-specific interactions in protein interaction networks