Sciweavers

1126 search results - page 127 / 226
» Similarity Evaluation on Tree-structured Data
Sort
View
MEDIAFORENSICS
2010
15 years 2 months ago
On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations
A number of methods have been proposed over the last decade for embedding information within deoxyribonucleic acid (DNA). Since a DNA sequence is conceptually equivalent to a unid...
Félix Balado
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 5 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
BMCBI
2008
200views more  BMCBI 2008»
15 years 4 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 5 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...