Sciweavers

9 search results - page 1 / 2
» wabi 2001
Sort
View
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
13 years 9 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
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
13 years 9 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
13 years 9 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
13 years 9 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
WABI
2001
Springer
162views Bioinformatics» more  WABI 2001»
13 years 9 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