Near optimal multiple alignment within a band in polynomial time

DOI10.1145/335305.335354MaRDI QIDQ5895203zbMATH OpenOpenAlexFDO

Authors Bin Ma, Lusheng Wang, Ming Li

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335354

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Protein sequences, DNA sequences (92D20)

Recommendations

• Near optimal multiple alignment within a band in polynomial time
• Improved Approximation Algorithms for Tree Alignment
• Approximation algorithms for multiple sequence alignment
• Multiple sequence alignment as a facility-location problem
• Research in Computational Molecular Biology

Cited in

(5)

• The longest common subsequence problem for sequences with nested arc annotations.
• Computing the similarity of two sequences with nested arc annotations
• Multiple sequence alignment as a facility-location problem
• Research in Computational Molecular Biology
• Near optimal multiple alignment within a band in polynomial time

This page was built for publication: Near optimal multiple alignment within a band in polynomial time

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