Sciweavers

321 search results - page 48 / 65
» Design of DNA origami
Sort
View
IPPS
2002
IEEE
13 years 11 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ISOLA
2010
Springer
13 years 5 months ago
LivingKnowledge: Kernel Methods for Relational Learning and Semantic Modeling
Latest results of statistical learning theory have provided techniques such us pattern analysis and relational learning, which help in modeling system behavior, e.g. the semantics ...
Alessandro Moschitti
BMCBI
2008
123views more  BMCBI 2008»
13 years 6 months ago
Statistical methodology for the analysis of dye-switch microarray experiments
Background: In individually dye-balanced microarray designs, each biological sample is hybridized on two different slides, once with Cy3 and once with Cy5. While this strategy ens...
Tristan Mary-Huard, Julie Aubert, Nadera Mansouri-...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 7 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
ICPP
2009
IEEE
14 years 1 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott