Complexity and algorithms for copy-number evolution problems.
CONCLUSIONS: For the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances.
AVAILABILITY: https://github.com/raphael-group/CNT-ILP.
PMID: 28515774 [PubMed]
Source: Algorithms for Molecular Biology : AMB - Category: Molecular Biology Authors: El-Kebir M, Raphael BJ, Shamir R, Sharan R, Zaccaria S, Zehavi M, Zeira R Tags: Algorithms Mol Biol Source Type: research