Using a previously developed automated method for enzyme annotation, we report the reannotation of the ENZYME database and the analysis of local error rates per class. In control ...
Benjamin Audit, Emmanuel D. Levy, Walter R. Gilks,...
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. ...
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...