Sciweavers

2381 search results - page 20 / 477
» Take Advantage of the Computing Power of DNA Computers
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
Anthony A. Philippakis, Aaron M. Qureshi, Michael ...
GRAPHITE
2006
ACM
14 years 2 months ago
Impostors and pseudo-instancing for GPU crowd rendering
Animated crowds are effective to increase realism in virtual reality applications. However, rendering crowds require large computational power. In this paper, we present a techniq...
Erik Millán, Isaac Rudomín
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
14 years 17 days ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
ICNC
2005
Springer
14 years 1 months ago
On Designing DNA Databases for the Storage and Retrieval of Digital Signals
Abstract. In this paper we propose a procedure for the storage and retrieval of digital signals utilizing DNA. Digital signals are encoded in DNA sequences that satisfy among other...
Sotirios A. Tsaftaris, Aggelos K. Katsaggelos
TCBB
2008
103views more  TCBB 2008»
13 years 8 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung