Sciweavers

387 search results - page 61 / 78
» Many Random Walks Are Faster Than One
Sort
View
DCC
2000
IEEE
14 years 1 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
BMCBI
2008
114views more  BMCBI 2008»
13 years 9 months ago
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping
Background: Serotypes of the Foot-and-Mouth disease viruses (FMDVs) were generally determined by biological experiments. The computational genotyping is not well studied even with...
Guohui Lin, Zhipeng Cai, Junfeng Wu, Xiu-Feng Wan,...
BMCBI
2005
201views more  BMCBI 2005»
13 years 9 months ago
A comparative study of discriminating human heart failure etiology using gene expression profiles
Background: Human heart failure is a complex disease that manifests from multiple genetic and environmental factors. Although ischemic and non-ischemic heart disease present clini...
Xiaohong Huang, Wei Pan, Suzanne Grindle, Xinqiang...
BMCBI
2011
13 years 4 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers