Constrained pairwise and center-star sequences alignment problems

DOI10.1007/s10878-015-9914-6zbMath1354.90124OpenAlexW1130115013MaRDI QIDQ328691

Hing-Fung Ting, Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Feng Zhang, Yong Zhang, Jian-Yu Shi

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9914-6

zbMATH Keywords

complexitydynamic programmingsequence alignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Uses Software

• ClustalW

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for computing variants of the longest common subsequence problem
• A faster algorithm computing string edit distances
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• A simple algorithm for the constrained sequence problems
• The complexity of multiple sequence alignment with SP-score that is a metric

This page was built for publication: Constrained pairwise and center-star sequences alignment problems