Connectivity problems on heterogeneous graphs.

Conclusion: Our results demonstrate that in contrast to most connectivity problems studied in computational biology, accounting for multiplicity of biological conditions adds considerable complexity, which we propose to address with a new solver. Importantly, our results extend to several network connectivity problems that are commonly used in computational biology, such as Prize-Collecting Steiner Tree, and provide insight into the theoretical guarantees for their applications in a multiple condition setting. PMID: 30899321 [PubMed]
Source: Algorithms for Molecular Biology : AMB - Category: Molecular Biology Authors: Tags: Algorithms Mol Biol Source Type: research