Home
Phylogeny Analysis
"One Click"
"Advanced"
"A la Carte"
Blast Explorer
Online Programs
Blast
Blast
Multiple Alignment
MUSCLE
T-Coffee
ClustalW
ProbCons
Phylogeny
PhyML
BioNJ
TNT
MrBayes
Tree Viewers
TreeDyn
Drawgram
Drawtree
ATV
Utilities
Gblocks
Jalview
Readseq
Format converter
Your Workspace
Documentation
Downloads
Contacts
MUSCLE 3.8.31 (
doc
)
1. Overview
2. Data & Settings
3. Results
Upload your set of sequences in FASTA, EMBL or NEXUS format from a file:
Or paste it here
(
load example of sequences
)
Maximum number of sequences is 200 for proteins and 200 for nucleic acids.
Maximum length of sequences is 2000 for proteins and 6000 for nucleic acids.
Advanced Settings...
MUSCLE run mode
Click here for details.
:
Full mode
Includes:
-stage 1: draft progressive alignment
-stage 2: improved progressive alignment
-stage 3: alignment refinement
Progressive mode (faster)
Includes:
-stage 1: draft progressive alignment
-stage 2: improved progressive alignment
Fastest mode
Includes:
-stage 1: draft progressive alignment using the fastest possible options
Default/custom mode
Use default/custom settings
Note:
parameters are adjusted according to the selected running mode
Maximum number of
iterations
You can control the number of iterations that MUSCLE does. If you specify 1, 2 or 3, then this is exactly the number of iterations that will be performed. If the value is greater than 3, then MUSCLE will continue up to the maximum you specify or until convergence is reached, which ever happens sooner. The default is 16. If you have a large number of sequences, curation may be rather slow.
:
(default: 16)
Find
diagonals
Creating a pair-wise alignment by dynamic programming requires computing an L1 × L2 matrix, where L1 and L2 are the sequence lengths. A trick used in algorithms such as BLAST is to reduce the size of this matrix by using fast methods to find diagonals, i.e. short regions of high similarity between the two sequences. This speeds up the algorithm at the expense of some reduction in accuracy. MUSCLE uses a technique called k-mer extension to find diagonals.
(faster for similar sequences)