[Name]: DSR
[Last update]: 2003
[Usage]: on request
[Description]: It calculates complexity using reciprocal complexity.
[Open source?]: no
[Reference]:[Name]: LPS-annotate
[Last update]: 2011
[Usage]: on request
[Description]: This algorithm defines compositional bias through a thorough search for lowest-probability subsequences (LPSs; Low Probability Sequences) and serves as workbench of tools now available to molecular biologists to generate hypotheses and inferences about the proteins that they are investigating.
[Open source?]: no
[Reference]:[Name]: SIMPLE
[Last update]: 2002
[Usage]: downloadable web
[Description]: It facilitates the quantification of the amount of simple sequence in proteins and determines the type of short motifs that show clustering above a certain threshold.
[Open source?]: yes
[Reference]:[Name]: SAPS
[Last update]: 1992
[Usage]: downloadable / web
[Description]: It describes several protein sequence statistics for the evaluation of distinctive characteristics of residue content and arrangement in primary structures.
[Open source?]: yes
[Reference]:[Name]: SubSeqer
[Last update]: 2008
[Usage]: web
[Description]: A graph-based approach for the detection and identification of repetitive elements in low–complexity sequences.
[Open source?]: no
[Reference]:[Name]: XNU
[Last update]: 1993
[Usage]: downloadable
[Description]: It uses the PAM120 scoring matrix for the calculation of complexity.
[Open source?]: yes
[Reference]:
New Random Display Display All Items(16)