scopnr removes redundant domains from a scop classification file.

This is part of Jon Ison's protein structure analysis package. This package is still being developed. Please ignore this program until further details can be documented. All further queries should go to Jon Ison (

Here is a sample session with scopnr:

% scopnr

Mandatory qualifiers (bold if not always prompted):

[-scopin] (infile)

Name of scop classification file (EMBL format input).

-mode (menu)

Select number.

-thresh (float)

The percentage sequence identity redundancy threshold.

-threshlow (float)

The percentage sequence identity redundancy threshold (lower limit).

-threshup (float)

The percentage sequence identity redundancy threshold (upper limit).

[-scopout] (outfile)

Name of non-redundant scop classification file (EMBL format output).

-errf (outfile)

Name of log file for the build.

Optional qualifiers:

-datafile (matrixf)

This is the scoring matrix file used when comparing sequences.

-gapopen (float)

The gap insertion penalty is the score taken away when a gap is created. The best value depends on the choice of comparison matrix. The default value assumes you are using the EBLOSUM62 matrix for protein sequences, and the EDNAFULL matrix for nucleotide sequences.

-gapextend (float)

The gap extension penalty is added to the standard gap penalty for each base or residue in the gap. This is how long gaps are penalized. You can usually expect a few long gaps rather than many short gaps, so the gap extension penalty should be lower than the gap penalty. An exception occurs when one or both sequences are single reads with possible sequencing errors, in which case you should expect many single base gaps. You can obtain this result by setting the gap open penalty to zero (or a very low value) and using the gap extension penalty to control gap scoring.

Sequence Analysis in a Nutshell
Sequence Analysis in a Nutshell: A Guide to Common Tools and Databases
ISBN: 059600494X
EAN: 2147483647
Year: 2005
Pages: 312

Similar book on Amazon © 2008-2017.
If you may any questions please contact us: