Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
From MaRDI portal
Publication:4995098
DOI10.1287/ijoc.2019.0937OpenAlexW3083912006MaRDI QIDQ4995098
Willem-Jan van Hoeve, Amin Hosseininasab
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0937
multiple sequence alignmentlogic-based Benders decompositionmultivalued decision diagramsdecision diagram filteringoptimistic filtering
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- Compiling propositional weighted bases
- Nonmonotonic reasoning: From complexity to algorithms
- Logic-based Benders decomposition
- A polyhedral approach to sequence alignment problems
- Hybrid optimization methods for time-dependent sequencing problems
- A branch-and-cut algorithm for multiple sequence alignment
- Discrete Optimization with Decision Diagrams
- Logic, Optimization, and Constraint Programming
- Polyhedral Characterization of Discrete Dynamic Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- The Multiple Sequence Alignment Problem in Biology
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A linear space algorithm for computing maximal common subsequences
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Branching Programs and Binary Decision Diagrams
- Multivalued Decision Diagrams for Sequencing Problems
- MDD Propagation for Sequence Constraints
- Experimental and Efficient Algorithms
This page was built for publication: Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
