ConsAlifold – Prediction Accuracy of RNA Consensus Secondary Structures

ConsAlifold

:: DESCRIPTION

ConsAlifold is a dynamic programming-based method that predicts the consensus secondary structure of an RNA sequence alignment.

::DEVELOPER

ConsAlifold team

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / Windows
  • Python

:: DOWNLOAD

ConsAlifold

:: MORE INFORMATION

Citation

Tagashira M, Asai K.
ConsAlifold: Considering RNA Structural Alignments Improves Prediction Accuracy of RNA Consensus Secondary Structures.
Bioinformatics. 2021 Oct 25:btab738. doi: 10.1093/bioinformatics/btab738. Epub ahead of print. PMID: 34694364.

PAcAlCI 1.2 – Prediction of Accuracy in Alignments based on Computational Intelligence

PAcAlCI 1.2

:: DESCRIPTION

PAcAlCI  is novel intelligent algorithm based on least square support vector machine (LS-SVM) to predict how accurately ten different MSA tools could align a particular set of sequences.

::DEVELOPER

Francisco M. Ortuño Guzman

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/MacOsX /Windows
  • MatLab

:: DOWNLOAD

  PAcAlCI

 :: MORE INFORMATION

Citation

Ortuño, F.M., Valenzuela, O., Pomares, H., Rojas, F., Florido, J.P., Urquiza, J.M., Rojas, I.:
Predicting the accuracy of multiple sequence alignment algorithms by using computational intelligent techniques.
Nucleic Acids Research 41, e26 (2013).

MIReNA 2.0 – Find microRNAs with high Accuracy and No Learning

MIReNA 2.0

:: DESCRIPTION

MIReNA is a tool to find microRNAs with high accuracy and no learning at genome scale and from deep sequencing data. MIReNA validates pre-miRNAs with high sensitivity and specificity, and detects new miRNAs by homology from known miRNAs or from deep sequencing data.

::DEVELOPER

Laboratory of Computational and Quantitative Biology(LCQB)

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/ MacOsX
  • Perl
  • Python
  • RNAfold

:: DOWNLOAD

 MIReNA

:: MORE INFORMATION

Citation

A. Mathelier and A. Carbone. (2010)
MIReNA: finding microRNAs with high accuracy and no learning at genome scale and from deep sequencing data.
Bioinformatics. 10.1093/bioinformatics/btq329

FastSP 1.6.0 – Calculation of Alignment Accuracy

FastSP 1.6.0

:: DESCRIPTION

FastSP is a Java program for computing alignment error (SP-FN) quickly and using little memory.

::DEVELOPER

The Warnow Lab 

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux /Windows/MacOsX
  • Java

:: DOWNLOAD

  FastSP

:: MORE INFORMATION

Citation:

Bioinformatics. 2011 Dec 1;27(23):3250-8. doi: 10.1093/bioinformatics/btr553. Epub 2011 Oct 7.
FastSP: linear time calculation of alignment accuracy.
Mirarab S1, Warnow T.

assp 1.2 – Assess Protein Secondary Structure Prediction Accuracy

assp 1.2

:: DESCRIPTION

assp (Assess  Secondary Structure Prediction) takes a multiple protein sequence alignmentand estimates the range in accuracy that one can expect for a “perfect” secondary structure prediction made using the alignment.

::DEVELOPER

The Barton Group

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

assp

:: MORE INFORMATION

Citation:

Russell, R. B. and Barton, G. J. (1993),
J. Mol. Biol., 234, 951-957,
The Limits of Protein Structure Prediction Accuracy From Multiple Sequence Alignment

OXBench 1.3 – Evaluate Accuracy of Protein Multiple Sequence Alignment

OXBench 1.3

:: DESCRIPTION

OXBench includes data and software to evaluate the accuracy of protein multiple sequence alignments.  It is a benchmark suite for multiple alignment algorithms that includes a large set of test alignments and software to aid in analysis of a method’s performance or relative performance.

::DEVELOPER

The Barton Group

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

OXBench

:: MORE INFORMATION

Citation:

Raghava, G. P. S., Searle, S. M. J., Audley, P. C, Barber, J. D. and Barton, G. J.
OXBench: A benchmark for evaluation of protein multiple sequence alignment accuracy
(2003), BMC Bioinformatics, 4:47

Facet v1.4 – Multiple Alignment Accuracy Estimation and Parameter Advising

Facet v1.4

:: DESCRIPTION

Facet (Feature-based accuracy estimator) computes a single estimate of accuracy as a linear combination of efficiently-computable feature functions.

::DEVELOPER

Dr. Dan DeBlasio

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / MacOs

:: DOWNLOAD

Facet

:: MORE INFORMATION

Citation

J Comput Biol. 2013 Apr;20(4):259-79. doi: 10.1089/cmb.2013.0007. Epub 2013 Mar 14.
Accuracy estimation and parameter advising for protein multiple sequence alignment.
Kececioglu J, DeBlasio D.

PepDistiller 1.26 – Improve Sensitivity & Accuracy of Peptide Identifications in Shotgun Proteomics

PepDistiller 1.26

:: DESCRIPTION

PepDistiller is a software designed to validate the peptide identifications obtained from MASCOT search results.

::DEVELOPER

Beijing Proteome Research Center Bioinformatics Group

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Windows
  • ActivePerl

:: DOWNLOAD

 PepDistiller

:: MORE INFORMATION

Citation

Proteomics. 2012 Jun;12(11):1720-5. doi: 10.1002/pmic.201100167.
PepDistiller: A quality control tool to improve the sensitivity and accuracy of peptide identifications in shotgun proteomics.
Li N, Wu S, Zhang C, Chang C, Zhang J, Ma J, Li L, Qian X, Xu P, Zhu Y, He F.

SEQuel 1.0.2 – Improving the Accuracy of Genome Assemblies

SEQuel 1.0.2

:: DESCRIPTION

SEQuel is a tool for improving the accuracy of high throughput sequencing assemblies.

::DEVELOPER

Roy Ronen and Christina Boucher in Pavel Pevzner’s lab at the University of California, San Diego.

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / Windows / MacOsX
  • Java
  • Perl

:: DOWNLOAD

  SEQuel

:: MORE INFORMATION

Citation

R. Ronen, C. Boucher, H. Chitsaz, and P. Pevzner.
SEQuel: Improving the Accuracy of Genome Assemblies.
Bioinformatics (2012) 28 (12): i188-i196.

SIB-BLAST – Algorithm to Improve Accuracy in PSI-BLAST Searches

SIB-BLAST

:: DESCRIPTION

SIB-BLAST  (Simple Is Beautiful) is a novel algorithm developed to overcome the model corruption problem that occurs frequently in the later iterations of PSI-BLAST searches.The algorithm compares resultant hits from iteration two and the final iteration of a PSI-BLAST search, calculates the figure of merit for each “overlapped” hit and re-ranks the hits according to their figure of merit. The premise of the algorithm is based on the observation that the profile, namely, the position specific scoring matrix (PSSM), in the first two rounds of a PSI-BLAST search, is the least corrupted since it is comprised mostly of close homologs. These profiles are used to search for more distant homologs, which are used to generate subsequent PSSMs. As more distant homologs are incorporated into the PSSM, non-homologous sequences frequently get included also, thus leading to model corruption. Hence, “benchmarking” hits from later iteration against earlier round when the model is least corrupted should improve the accuracy of a PSI-BLAST search.

::DEVELOPER

Ralf Bundschuh‘s statistical physics group at the Department of Physics of The Ohio State University.

:: SCREENSHOTS

N/A

: REQUIREMENTS

  • Linux

:: DOWNLOAD

 SIB-BLAST

:: MORE INFORMATION

Citation:

M.M. Lee, M. Chan, and R. Bundschuh,
Simple is beautiful: a straightforward approach to improve the delineation of true and false positives in PSI-BLAST searches“,
Bioinformatics 24 (2008) 1339-1343.

 

Exit mobile version