Sciweavers

85 search results - page 12 / 17
» On Sorting Permutations by Double-Cut-and-Joins
Sort
View
TCBB
2010
137views more  TCBB 2010»
14 years 4 months ago
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
István Miklós, Bence Melykuti, Krist...
BMCBI
2007
148views more  BMCBI 2007»
14 years 9 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
80
Voted
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...
SP
2006
IEEE
15 years 3 months ago
Deterring Voluntary Trace Disclosure in Re-encryption Mix Networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
Philippe Golle, XiaoFeng Wang, Markus Jakobsson, A...
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
14 years 10 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto