Sciweavers

167 search results - page 16 / 34
» Synthetic Biology
Sort
View
ISMB
1997
13 years 8 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
TCBB
2008
116views more  TCBB 2008»
13 years 6 months ago
Inferring Connectivity of Genetic Regulatory Networks Using Information-Theoretic Criteria
Recently, the concept of mutual information has been proposed for inferring the structure of genetic regulatory networks from gene expression profiling. After analyzing the limitat...
Wentao Zhao, Erchin Serpedin, Edward R. Dougherty
BMCBI
2004
181views more  BMCBI 2004»
13 years 6 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
BMCBI
2007
190views more  BMCBI 2007»
13 years 6 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey
RECOMB
2001
Springer
14 years 7 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa