-
[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]: 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]: fLPS
[Last update]: 2017
[Usage]: downloadable / web
[Description]: It can readily handle very large protein data sets, such as might come from metagenomics projects. It is useful in searching for proteins with similar CBRs and for making functional inferences about CBRs for a protein of interest
[Open source?]: yes
[Reference]: -
[Name]: CAST
[Last update]: 2000
[Usage]: web
[Description]: It identifies LCRs using dynamic programming.
[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]: Oj.py
[Last update]: 2001
[Usage]: on request
[Description]: A tool for demarcating low complexity protein domains.
[Open source?]: no
[Reference]: -
[Name]: DSR
[Last update]: 2003
[Usage]: on request
[Description]: It calculates complexity using reciprocal complexity.
[Open source?]: no
[Reference]: -
[Name]: ScanCom
[Last update]: 2003
[Usage]: on request
[Description]: Calculates the compositional complexity using the linguistic complexity measure.
[Open source?]: no
[Reference]: -
[Name]: CARD
[Last update]: 2005
[Usage]: on request
[Description]: Based on the complexity analysis of subsequences delimited by pairs of identical, repeating subsequences.
[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]: 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]: ANNIE
[Last update]: 2009
[Usage]: web
[Description]: This method creates an automation of the sequence analytic process.
[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]: LCReXXXplorer
[Last update]: 2015
[Usage]: web
[Description]: A web platform to search, visualize and share data for low complexity regions in protein sequences. LCR-eXXXplorer offers tools for displaying LCRs from the UniProt/SwissProt knowledgebase, in combination with other relevant protein features, predicted or experimentally verified. Also, users may perform queries against a custom designed sequence/LCR-centric database.
[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)