Sciweavers

497 search results - page 15 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
RECOMB
2003
Springer
14 years 8 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
RECOMB
2000
Springer
13 years 11 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
BMCBI
2010
109views more  BMCBI 2010»
13 years 7 months ago
Free energy estimation of short DNA duplex hybridizations
Background: Estimation of DNA duplex hybridization free energy is widely used for predicting cross-hybridizations in DNA computing and microarray experiments. A number of software...
Dan C. Tulpan, Mirela Andronescu, Serge Leger
BMCBI
2010
190views more  BMCBI 2010»
13 years 7 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang