A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

Althaus, Ernst; Canzar, Stefan

doi:10.1007/978-3-540-73556-4_29

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

MPS-Authors

/persons/resource/persons44003

Althaus, Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44218

Canzar, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Althaus, E., & Canzar, S. (2007). A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. In A. Dress, Y. Xu, & B. Zhu (Eds.), Combinatorial Optimization and Applications: First International Conference, COCOA 2007 (pp. 267-278). Berlin: Springer. doi:10.1007/978-3-540-73556-4_29.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1DF3-3

Abstract

There is no abstract available