Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree

DOI10.1016/S0166-218X(98)00079-1zbMath0927.68116OpenAlexW2025734773MaRDI QIDQ1281780

R. Ravi, John D. Kececioglu

Publication date: 19 December 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00079-1

zbMATH Keywords

Steiner pointbottleneck tree-alignment

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05)

Related Items (2)

The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances

Cites Work

• Unnamed Item
• Line geometries for sequence comparisons
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Approximation algorithms for tree alignment with a given phylogeny
• Trees, Stars, and Multiple Biological Sequence Alignment
• The Multiple Sequence Alignment Problem in Biology
• Multiple Alignment, Communication Cost, and Graph Matching
• Minimal Mutation Trees of Sequences

This page was built for publication: Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree