Sciweavers

3055 search results - page 181 / 611
» Randomized Search Trees
Sort
View
PRL
2006
96views more  PRL 2006»
15 years 19 days ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
119
Voted
CSR
2006
Springer
15 years 4 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
15 years 4 months ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
111
Voted
IPL
2000
82views more  IPL 2000»
15 years 15 days ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith