-
[Name]: SEG
[Last update]: 1993
[Usage]: downloadable
[Description]: It is a two pass algorithm: first, identifies the LCR, and then performs local optimization by masking with Xs the LCRs
[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]: BIAS
[Last update]: 2006
[Usage]: downloadable / web
[Description]: It uses discrete scan statistics that provide a highly accurate multiple test correction to compute analytical estimates of the significance of each compositionally biased segment.
[Open source?]: yes
[Reference]: -
[Name]: GBA
[Last update]: 2006
[Usage]: on request
[Description]: A graph-based algorithm that constructs a graph of the sequence.
[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]:
New Random Display Display All Items(16)