Near optimal multiple alignment within a band in polynomial time

DOI10.1145/335305.335354zbMath1296.68081OpenAlexW2161376695MaRDI QIDQ5895203

Lusheng Wang, Bin Ma, 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) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)

Related Items (2)

The longest common subsequence problem for sequences with nested arc annotations. ⋮ Computing the similarity of two sequences with nested arc annotations

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