Sciweavers

WABI
2001
Springer
162views Bioinformatics» more  WABI 2001»
13 years 10 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
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
13 years 10 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
13 years 10 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
WABI
2001
Springer
134views Bioinformatics» more  WABI 2001»
13 years 10 months ago
Comparing Assemblies Using Fragments and Mate-Pairs
Using current technology, large consecutive stretches of DNA (such as whole chromosomes) are usually assembled from short fragments obtained by shotgun sequencing, or from fragment...
Daniel H. Huson, Aaron L. Halpern, Zhongwu Lai, Eu...
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
13 years 10 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian
Bioinformatics
Top of PageReset Settings