150 search results - page 6 / 30 » Parallel Generation of Pseudo-Random Sequences |
IPPS
2002
IEEE
14 years 10 days ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
Sequence comparison is considered as a cornerstone application in bioinformatics, which forms the basis of many other applications. In particular, pairwise sequence alignment is a...
IJNSEC
2008
13 years 7 months ago
2008
In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multirate parallel combinations of binary Legendre sequences which are cl...
BIOINFORMATICS
2012
11 years 9 months ago
2012
Motivation: Next-generation sequencing methods are generating increasingly massive datasets, yet still do not fully capture genetic diversity in the richest environments. To under...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...