ASaturADemonstrate saturation in nucleotide sequences | |
Download |
ASaturA Ranking & Summary
Advertisement
- License:
- Freeware
- Publisher Name:
- Bioinformatics & Systems Biology
- Operating Systems:
- Windows All
- File Size:
- 180 KB
ASaturA Tags
- sequence Saturation Effect Valve Saturation Saturation saturation shaper saturation algorithm tape saturation saturation simulation black saturation saturation adjuster adjust saturation change saturation fix saturation conditional saturation change Photoshop saturation 3d planet generator nucleotide proportion mutation Saturation track nucleotide sequence nucleotide sequence manager nucleotide transformer saturation saturation simulator analogue saturation modify saturation saturation modifier correct saturation nucleotide substitution model nucleotide motif demonstrate nucleotide substitution nucleotide annotation nucleotide alignments nucleotide polymorphisms nucleotide mutation nucleotide fraction Pacific Islands Screensaver free java antivirus codec file flv swf to fla how to read bittorrent lite doodle jump 1.8.2 yahoo video roxxana versa check driver blackberry 1800 software karaoke song cdg
ASaturA Description
The usual way to demonstrate saturation in nucleotide sequences is to plot the fraction of differences between sequences against the evolutionary distance separating them. When the number of observed differences, for example for the fraction of third codon positions, no longer increases with increasing evolutionary distance, the sequence is said to be saturated. The same technique can be applied to amino acid (aa) sequences. We have developed a Java application called ASaturA that discriminates aa substitutions with high and low probabilities of occurrence. All aa replacements are defined either as 'frequent' or as 'rare' depending on their mutation probabilities, which are inferred from substitution probability matrices, such as the well-known PAM and BLOSUM. These 20 by 20 matrices provide the empirically derived probabilities of one aa being replaced by another one when sequences have diverged over a certain evolutionary distance. The ASaturA application will sort all substitutions according to these probabilities and a probability 'cut-off' value can be chosen that differentiates between frequent and rare substitutions. For each sequence pair, the program plots the number of observed frequent and rare aa replacements against their evolutionary distance. By modifying the substitution probability 'cut-off' value, the number of aa substitutions classified as frequent or rare can be changed. Ideally, careful selection of the 'cut-off' value splits the original data set into a saturated and an unsaturated one. Besides the most widely used substitution probability matrices, such as PAM, BLOSUM, mtREV24 and JTT, user-defined matrices can be used also.
ASaturA Related Software