Algorithms and Computation
From MaRDI portal
Publication:5191663
DOI10.1007/b94771zbMath1205.68171OpenAlexW1769833081MaRDI QIDQ5191663
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Is the protein model assignment problem under linked branch lengths NP-hard? ⋮ Searching for a set of correlated patterns ⋮ A Lagrangian relaxation approach for the multiple sequence alignment problem ⋮ Non-approximability of weighted multiple sequence alignment for arbitrary metrics
This page was built for publication: Algorithms and Computation
