Multiple Sequence Alignment as a Facility-Location Problem

DOI10.1287/ijoc.1040.0093zbMath1239.90114OpenAlexW2163284282MaRDI QIDQ2890444

Winfried Just, Gianluca Della Vedova

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0bf1c0e2d374a6baa2fd904c9281138d7836ce31

zbMATH Keywords

computational complexityanalysis of algorithmsequipment planning

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Mathematical programming in computational biology: an annotated bibliography ⋮ Parametric multiple sequence alignment and phylogeny construction ⋮ Optimal global alignment of signals by maximization of Pearson correlation

This page was built for publication: Multiple Sequence Alignment as a Facility-Location Problem