Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology
From MaRDI portal
Publication:5041127
DOI10.1007/978-3-030-42266-0_6zbMath1500.92030OpenAlexW3013362614MaRDI QIDQ5041127
Hannah Brown, Lei Zuo, Dan Gusfield
Publication date: 13 October 2022
Published in: Algorithms for Computational Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42266-0_6
Problems related to evolution (92D15) Integer programming (90C10) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)
Cites Work
- Unnamed Item
- Unnamed Item
- An integer programming model for protein structure prediction using the 3D-HP side chain model
- Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
- Integer Linear Programming in Computational and Systems Biology
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology