A mostrar 1 - 20 resultados de 795 para a pesquisa '(( 0 fast computer ((can netw) OR (can new)) ) OR ( j nat compared _ netw ))', tempo de pesquisa: 1.02seg Refinar resultados
2
... by NGS. We propose a new algorithm, FastHASH, which drastically improves the performance of the seed...
Obter o texto integral
Obter o texto integral
Obter o texto integral
Artigo
4
... computationally-expensive algorithm (i.e., sequence alignment) to determine the origin of the read. A seed...
Obter o texto integral
Artigo
6
... coefficients. It is compared with state-of-the-art algorithms in terms of computational cost and the maximum...
Obter o texto integral
Artigo
8
... parallel problems, but can prove demanding for the programmer. On the other hand the new MIC architecture...
Obter o texto integral
Obter o texto integral
Obter o texto integral
Artigo
9
Por Andreica, Mugurel Ionut
Publicado em 2013
...) with 0 ≤ Q ≤ P ≤ 2(N) − 1 can be computed modulo 2(N) in O(N (2) · log(N) · Multiplication(N)) time...
Obter o texto integral
Obter o texto integral
Obter o texto integral
Artigo
10
11
Por Byoungwook Kim
Publicado em 2017-04-01
Assuntos: ...partial distance computation...
Obter o texto integral
Artigo
13
Por Guo, Minyi, Yang, Laurence Tianruo
Publicado em 2005
... and grid computing, has moved parallel/distributed computing into the mainstream of computing. New Horizons...
Obter o texto integral
Livro
16
Por Walsh, J. Bruce
Publicado em 1987
... frequencies decrease as genes diverge are examined to determine conditions underwhich genes can "escape...
Obter o texto integral
Obter o texto integral
Artigo
19
Por Cunge Han, Wensen Yu, Xiaofei Li, Hai Lin, Huanyun Zhao
Publicado em 2022-01-01
...As the first incremental association mining algorithm, FUP can well solve the problem...
Obter o texto integral
Artigo
20