Constrained pairwise and center-star sequences alignment problems

DOI10.1007/S10878-015-9914-6MaRDI QIDQ328691zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the complexity of constrained sequences alignment problems
• Constrained sequence alignment: A general model and the hardness results
• Implementation and Application of Automata
• An algorithm and applications to sequence alignment with weighted constraints
• A fast algorithm for the constrained multiple sequence alignment problem

Cites work

• A faster algorithm computing string edit distances
• A simple algorithm for the constrained sequence problems
• Algorithms for computing variants of the longest common subsequence problem
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms.
• The complexity of multiple sequence alignment with SP-score that is a metric

Cited in

(3)

• Constrained sequence alignment: A general model and the hardness results
• On the complexity of constrained sequences alignment problems
• Parametric sequence alignment with constraints

Describes a project that uses

Uses Software

• ClustalW

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

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