Sciweavers

426 search results - page 69 / 86
» Run lengths and liquidity
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
13 years 10 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
JCB
2006
124views more  JCB 2006»
13 years 9 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
CLUSTER
2002
IEEE
13 years 9 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
BMCBI
2010
133views more  BMCBI 2010»
13 years 7 months ago
Initial steps towards a production platform for DNA sequence analysis on the grid
Background: Bioinformatics is confronted with a new data explosion due to the availability of high throughput DNA sequencers. Data storage and analysis becomes a problem on local ...
Angela C. M. Luyf, Barbera D. C. van Schaik, Miche...