Sciweavers

426 search results - page 68 / 86
» Run lengths and liquidity
Sort
View
FOCS
2000
IEEE
14 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
FCCM
2004
IEEE
175views VLSI» more  FCCM 2004»
14 years 1 months ago
A Flexible Hardware Encoder for Low-Density Parity-Check Codes
We describe a flexible hardware encoder for regular and irregular low-density parity-check (LDPC) codes. Although LDPC codes achieve achieve better performance and lower decoding ...
Dong-U Lee, Wayne Luk, Connie Wang, Christopher Jo...
BMCBI
2010
120views more  BMCBI 2010»
13 years 10 months ago
Short clones or long clones? A simulation study on the use of paired reads in metagenomics
Background: Metagenomics is the study of environmental samples using sequencing. Rapid advances in sequencing technology are fueling a vast increase in the number and scope of met...
Suparna Mitra, Max Schubach, Daniel H. Huson
BMCBI
2008
122views more  BMCBI 2008»
13 years 10 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood