IBM Bioinformatics Group - Tools & Content

Options Parameters
Equivalency Sets (type or paste)
 Discovery Using Equivalences 
Exact Discovery 
 Max Brackets: 
L: 
W: 
K: 
Q: 
Case sensitive!

Seq Version 
Remove Overlaps 
Upper Case 
Hydropathy Coloring 
Only amino acid characters 
Only nucleic acid characters 
 Accept all characters 
Input Sequences (type or paste) 30K Netscape limits
powered by the Musca algorithm
References:
  • Parida, L., A. Floratos and I. Rigoutsos, MUSCA: An Algorithm for Constrained Alignment of Multiple Data Sequences. Proceedings 9th Workshop on Genome Informatics, Tokyo, Japan. December 1998.
  • Parida, L., A. Floratos and I. Rigoutsos, An Approximation Algorithm for Alignment of Multiple Sequences Using Motif Discovery. Journal of Combinatorial Optimization, 3(2/3): 247-275, July 1999.