For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...
—This paper introduces a novel optimization paradigm for increasing the throughput of digital systems. The basic idea consists of transforming fixed-latency units into variable-...
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...