Sciweavers

388 search results - page 19 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
RECOMB
2003
Springer
15 years 10 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
BMCBI
2010
153views more  BMCBI 2010»
14 years 9 months ago
Metamotifs - a generative model for building families of nucleotide position weight matrices
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
Matias Piipari, Thomas A. Down, Tim J. P. Hubbard
68
Voted
RECOMB
2008
Springer
15 years 10 months ago
CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads
A major hindrance to studies of microbial diversity has been that the vast majority of microbes cannot be cultured in the laboratory and thus are not amenable to traditional method...
Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, ...
109
Voted
RECOMB
2002
Springer
15 years 10 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
98
Voted
WABI
2001
Springer
162views Bioinformatics» more  WABI 2001»
15 years 2 months ago
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites
A central issue in molecular biology is understanding the regulatory mechanisms that control gene expression. The recent flood of genomic and postgenomic data opens the way for co...
Yoseph Barash, Gill Bejerano, Nir Friedman