Sciweavers

2127 search results - page 60 / 426
» Computing large matchings fast
Sort
View
131
Voted
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
15 years 5 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
124
Voted
BMCBI
2006
116views more  BMCBI 2006»
15 years 3 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
135
Voted
ECCV
2010
Springer
15 years 8 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
SSDBM
2006
IEEE
153views Database» more  SSDBM 2006»
15 years 9 months ago
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user com...
Luke J. Gosink, John Shalf, Kurt Stockinger, Keshe...
121
Voted
ISMB
1998
15 years 4 months ago
Automated Clustering and Assembly of Large EST Collections
The avMlability of large EST(Expressed Sequence Tag)databases has led to a revolution in the waynew genes are cloned. Difficulties arise, however,due to high error rates and redun...
David P. Yee, Darrell Conklin