Sciweavers

621 search results - page 73 / 125
» DNA Computing in Microreactors
Sort
View
BMCBI
2008
172views more  BMCBI 2008»
13 years 8 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
GECCO
2004
Springer
113views Optimization» more  GECCO 2004»
14 years 1 months ago
Implications of Epigenetic Learning Via Modification of Histones on Performance of Genetic Programming
Extending the notion of inheritable genotype in genetic programming (GP) from the common model of DNA into chromatin (DNA and histones), we propose an approach of embedding in GP a...
Ivan Tanev, Kikuo Yuta
CIKM
2008
Springer
13 years 10 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
DNA
2006
Springer
130views Bioinformatics» more  DNA 2006»
13 years 10 months ago
Displacement Whiplash PCR: Optimized Architecture and Experimental Validation
Whiplash PCR-based methods of biomolecular computation (BMC), while highly-versatile in principle, are well-known to suffer from a simple but serious form of self-poisoning known a...
John A. Rose, Ken Komiya, Satsuki Yaegashi, Masami...
DAM
2007
91views more  DAM 2007»
13 years 8 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...