Sciweavers

161 search results - page 25 / 33
» Efficient Algorithms for Handling Molecular Weighted Sequenc...
Sort
View
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 8 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
BMCBI
2007
177views more  BMCBI 2007»
13 years 7 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
TOG
2002
127views more  TOG 2002»
13 years 7 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
IMR
2003
Springer
14 years 26 days ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
BALT
2006
13 years 11 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut