Sciweavers

2512 search results - page 109 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
CORR
2006
Springer
118views Education» more  CORR 2006»
14 years 10 months ago
Integration and mining of malaria molecular, functional and pharmacological data: how far are we from a chemogenomic knowledge s
The organization and mining of malaria genomic and post-genomic data is important to significantly increase the knowledge of the biology of its causative agents, and is motivated,...
L.-M. Birkholtz, Olivier Bastien, G. Wells, D. Gra...
BMCBI
2011
14 years 1 months ago
Detection of recurrent rearrangement breakpoints from copy number data
Background: Copy number variants (CNVs), including deletions, amplifications, and other rearrangements, are common in human and cancer genomes. Copy number data from array compara...
Anna M. Ritz, Pamela L. Paris, Michael Ittmann, Co...
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
15 years 4 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 2 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
AUSAI
2006
Springer
15 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb