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

Genome Inform

Department of Computer Science, University of Vermont, Burlington, 05405, USA.

Published: September 2006

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

Download full-text PDF	Source

Publication Analysis

Top Keywords

constrained pairwise

pairwise sequence

sequence alignment

space-efficient algorithm

algorithm constrained

alignment problem

problem constrained

alignment cpsa

cpsa problem

problem aims

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!