Algorithms and Computation

DOI10.1007/B94771zbMATH Open1205.68171OpenAlexW1769833081MaRDI QIDQ5191663FDOQ5191663

Authors: Isaac Elias 

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

Recommendations

• The complexity of multiple sequence alignment with SP-score that is a metric
• Complexity of biological sequence alignment
• Alignment between two multiple alignments
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics
• Multiple sequence alignment as a facility-location problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (7)

• Title not available (Why is that?)
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics
• Is the protein model assignment problem under linked branch lengths NP-hard?
• A Lagrangian relaxation approach for the multiple sequence alignment problem
• Complexity of biological sequence alignment
• Searching for a set of correlated patterns
• Title not available (Why is that?)

This page was built for publication: Algorithms and Computation

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