Sciweavers

91 search results - page 3 / 19
» Algorithms for optimizing production DNA sequencing
Sort
View
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
2005
84views more  BMCBI 2005»
13 years 7 months ago
Information theory-based algorithm for in silico prediction of PCR products with whole genomic sequences as templates
Background: A new algorithm for assessing similarity between primer and template has been developed based on the hypothesis that annealing of primer to template is an information ...
Youfang Cao, Lianjie Wang, Kexue Xu, Chunhai Kou, ...
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
BMCBI
2010
152views more  BMCBI 2010»
13 years 7 months ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse