Sciweavers

3341 search results - page 630 / 669
» On Bounded Queries and Approximation
Sort
View
73
Voted
BMCBI
2006
116views more  BMCBI 2006»
14 years 9 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
AICOM
2004
118views more  AICOM 2004»
14 years 9 months ago
Qualitative pattern matching with linguistic terms
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
Yannick Loiseau, Henri Prade, Mohand Boughanem
BMCBI
2004
139views more  BMCBI 2004»
14 years 9 months ago
mlstdbNet - distributed multi-locus sequence typing (MLST) databases
Background: Multi-locus sequence typing (MLST) is a method of typing that facilitates the discrimination of microbial isolates by comparing the sequences of housekeeping gene frag...
Keith A. Jolley, Man-Suen Chan, Martin C. J. Maide...
CORR
2002
Springer
105views Education» more  CORR 2002»
14 years 9 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
TKDE
2010
148views more  TKDE 2010»
14 years 8 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang