منابع مشابه
BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm
MOTIVATION Mapping of high-throughput sequencing data and other bulk sequence comparison applications have motivated a search for high-efficiency sequence alignment algorithms. The bit-parallel approach represents individual cells in an alignment scoring matrix as bits in computer words and emulates the calculation of scores by a series of logic operations composed of AND, OR, XOR, complement, ...
متن کاملA Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
Mapping of next-generation sequencing data and other processor-intensive sequence comparison applications have motivated a continued search for high efficiency sequence alignment algorithms. In one approach, which exploits the inherent parallelism in computer logic calculations, individual cells in an alignment scoring matrix are represented as bits in a computer word and the calculation of sco...
متن کاملa 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter
applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...
15 صفحه اولA Note on Bit-Parallel Alignment Computation
The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit operations are one or more of the following: an insertion, a deletion or a substitution of a character, or a transposition between two adjacent characters. Simple edit distance allows the first two operation types, Levenshtein edit...
متن کاملParallel Sequence Comparison and Alignment
Sequence comparison, a vital research tool in computational biology, is based on a simple O(n) algorithm that easily maps to a linear array of processors. This paper reviews and compares high-performance sequence analysis on general-purpose supercomputers and single-purpose, recon gurable, and programmable co-processors. The di culty of comparing hardware from published performance gures is als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2019
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btz162