Register for free to
view the full innovation profile.
MAP is good at producing an alignment where there are long terminal or internal gaps in some sequences.
About
Abstract The MAP program computes a multiple global alignment of sequences using iterative pairwise method. The underlying algorithm for aligning two sequences computes a best overlapping alignment between two sequences without penalizing terminal gaps. In addition, long internal gaps in short sequences are not heavily penalized. So MAP is good at producing an alignment where there are long terminal or internal gaps in some sequences. The MAP program is designed in a space-efficient manner so long sequences can be aligned. Note that sequences must be all DNA/cDNA sequences or all protein sequences. Case Number: 9510.00 Status: Commercial Software Related Categories Computational analysis-modeling, Genetics-genetic engineering, Info. technology - processing and software