Sciweavers

BMCBI
2002
137views more  BMCBI 2002»
13 years 11 months ago
ORFer - retrieval of protein sequences and open reading frames from GenBank and storage into relational databases or text files
Background: Functional genomics involves the parallel experimentation with large sets of proteins. This requires management of large sets of open reading frames as a prerequisite ...
Konrad Büssow, Steve Hoffmann, Volker Sievert
GPEM
2007
119views more  GPEM 2007»
13 years 11 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
JCT
2006
88views more  JCT 2006»
13 years 11 months ago
Multiplicative structures in additively large sets
Abstract. Previous research extending over a few decades has established that multiplicatively large sets (in any of several interpretations) must have substantial additive structu...
Mathias Beiglböck, Vitaly Bergelson, Neil Hin...
DM
2007
129views more  DM 2007»
13 years 11 months ago
3-Designs with block size 6 from PSL(2, q) and their large sets
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admitting PSL(2, q) as an automorphism group. We show the existence of simple 3-(28...
G. R. Omidi, M. R. Pournaki, Behruz Tayfeh-Rezaie
BMCBI
2007
106views more  BMCBI 2007»
13 years 11 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
DM
2006
105views more  DM 2006»
13 years 11 months ago
Large sets of t-designs through partitionable sets: A survey
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
ACSAC
2008
IEEE
14 years 1 months ago
Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
Paul F. Farrell Jr., Simson L. Garfinkel, Douglas ...
EMNETS
2007
14 years 3 months ago
Image browsing, processing, and clustering for participatory sensing: lessons from a DietSense prototype
Imagers are an increasingly significant source of sensory observations about human activity and the urban environment. ImageScape is a software tool for processing, clustering, an...
Sasank Reddy, Andrew Parker, Josh Hyman, Jeff Burk...
MMB
2001
Springer
131views Communications» more  MMB 2001»
14 years 3 months ago
Seawind: a Wireless Network Emulator
Behavior of current communication protocols as well as current and future networked applications is of fundamental importance for technical and commercial success of Mobile Intern...
Markku Kojo, Andrei Gurtov, Jukka Manner, Pasi Sar...
DCC
2004
IEEE
14 years 11 months ago
Some Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie