Parallelization on graphic hardware : contributions to RNA folding and sequence alignment

To be coherent with the definition of simple non-standard pseudoknots given in [11], we define the degree of a standard structure as it number of pivots in its ordering wave

In the present paper, we prove that the average complexity of the tree align- ment algorithm of [10] is in O(nm), as well as the average complexity of the RNA structure

It is noticeable, that the proportion of markers corresponding to ex- isting sequence fragments of unknown location in the sequence assembly was higher in this region of the RH map

Using a corpus of 500,000 Hungarian words paired with a gold standard morphological analysis, we ran the MetaMorph algorithm on various corpus subset sizes, column

Algorithm 4 provides a simple and exact solution to compute the SP-score under affine gap penalties in O(nL), which is also the time complexity for just reading an alignment of

The developed approach uses the particle swam optimization (PSO) algorithm to discover the search space globally and the simulated annealing (SA) technique to improve the

[5] proposed a parallel solution for a variant of the problem under the CGM model using weighted graphs that requires log p rounds and runs in On2 log m/p time.. Recently, Kim

From left to right: (1) Best single feature, (2) Best learned combination of features using the symmetrized area loss ` S , (3) Best combination of MFCC using SAL and D T obtained