Sciweavers

2104 search results - page 60 / 421
» Sorting with networks of data structures
Sort
View
123
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 5 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
DAGSTUHL
1993
15 years 5 months ago
Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van...
BMCBI
2007
108views more  BMCBI 2007»
15 years 4 months ago
Integrating sequence and structural biology with DAS
Background: The Distributed Annotation System (DAS) is a network protocol for exchanging biological data. It is frequently used to share annotations of genomes and protein sequenc...
Andreas Prlic, Thomas A. Down, Eugene Kulesha, Rob...
SAC
2006
ACM
15 years 10 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 8 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...