A space-efficient algorithm for the constrained pairwise sequence alignment problem.

Dan He, Abdullah N. Arslan · PubMed · 2005

The constrained pairwise sequence alignment (CPSA) problem aims to align two given sequences by aligning their similar subsequences in the same region under the guidance of a given pattern (constraint). Let the lengths of the sequences be m, and n where n <or= m, and let r

Read the paper · More papers on PaperTik