A Lagrangian relaxation approach for the multiple sequence alignment problem
type: Item
instance of: scholarly article
title: A Lagrangian relaxation approach for the multiple sequence alignment problem
zbMATH Open document ID: 1161.92027
author: Ernst Althaus
author: Stefan Canzar
published in: Journal of Combinatorial Optimization
publication date: 2009-05-04T00:00:00Z
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5550477
zbMATH Keywords: sequence comparison
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: branch and bound
describes a project that uses: T-coffee
describes a project that uses: LEDA
describes a project that uses: DIALIGN
describes a project that uses: ClustalW
describes a project that uses: MUSCLE
describes a project that uses: MAFFT
describes a project that uses: MUMMER
MaRDI profile type: Publication
full work available at URL: s10878-008-9139-z
OpenAlex ID: W2797388202
cites work: A branch-and-cut algorithm for multiple sequence alignment
cites work: A Heuristic Method for the Set Covering Problem
cites work: The Multiple Sequence Alignment Problem in Biology
cites work: Algorithms and Computation
cites work: Sequence comparison with mixed convex and concave costs
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Q4198056
cites work: Algorithms on Strings, Trees and Sequences
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q3138930
cites work: Q4702188
DOI: 10.1007/S10878-008-9139-Z
description: scientific article; zbMATH DE number 5550477