Sciweavers

86 search results - page 6 / 18
» DNA Models and Algorithms for NP-Complete Problems
Sort
View
CSB
2003
IEEE
14 years 29 days ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
BMCBI
2007
158views more  BMCBI 2007»
13 years 7 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
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
GCB
2006
Springer
158views Biometrics» more  GCB 2006»
13 years 11 months ago
Microarray Layout as Quadratic Assignment Problem
Abstract: The production of commercial DNA microarrays is based on a light-directed chemical synthesis driven by a set of masks or micromirror arrays. Because of the natural proper...
Sérgio A. de Carvalho, Sven Rahmann
TCBB
2008
103views more  TCBB 2008»
13 years 7 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