Exact Multiple Sequence Alignment by Synchronized Decision Diagrams

DOI10.1287/IJOC.2019.0937MaRDI QIDQ4995098zbMATH OpenOpenAlexFDO

Authors Amin Hosseininasab, Willem-Jan van Hoeve

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

zbMATH Keywords

logic-based Benders decompositionmultiple sequence alignmentmultivalued decision diagramsdecision diagram filteringoptimistic filtering

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A Lagrangian relaxation approach for the multiple sequence alignment problem
• scientific article; zbMATH DE number 2243390
• An optimization approach to multiple sequence alignment
• A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
• A branch-and-cut algorithm for multiple sequence alignment

Cites work

• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A branch-and-cut algorithm for multiple sequence alignment
• A linear space algorithm for computing maximal common subsequences
• A polyhedral approach to sequence alignment problems
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Branching Programs and Binary Decision Diagrams
• Compiling propositional weighted bases
• Discrete optimization with decision diagrams
• Experimental and Efficient Algorithms
• Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
• Graph-Based Algorithms for Boolean Function Manipulation
• Hybrid optimization methods for time-dependent sequencing problems
• Logic, optimization, and constraint programming
• Logic-based Benders decomposition
• MDD propagation for sequence constraints
• Multivalued decision diagrams for sequencing problems
• Nonmonotonic reasoning: From complexity to algorithms
• Polyhedral Characterization of Discrete Dynamic Programming
• The Multiple Sequence Alignment Problem in Biology
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation

Cited in

(1)

• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Describes a project that uses

Uses Software

• MUSCLE

This page was built for publication: Exact Multiple Sequence Alignment by Synchronized Decision Diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995098)