Article
Post-processing long pairwise alignments.
Bioinformatics (Oxford, England) - 1 Dec 1999
Zhang Z, Berman P, Wiehe T, Miller W
Abstract excerpt
MOTIVATION: The local alignment problem for two sequences requires determining similar regions, one from each sequence, and aligning those regions. For alignments computed by dynamic programming, current approaches for selecting similar regions may have potential flaws. For instance, the criterion of Smith and Waterman can lead to inclusion of an arbitrarily poor internal segment. Other approaches can generate an...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.
