Sciweavers

5105 search results - page 662 / 1021
» Approximate Structural Consistency
Sort
View
ERLANG
2003
ACM
16 years 1 days ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
WSC
2000
15 years 8 months ago
SNOOPy Calendar Queue
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...
Kah Leong Tan, Ian Li-Jin Thng
185
Voted
BMCBI
2007
168views more  BMCBI 2007»
15 years 6 months ago
Benchmarking consensus model quality assessment for protein fold recognition
Background: Selecting the highest quality 3D model of a protein structure from a number of alternatives remains an important challenge in the field of structural bioinformatics. M...
Liam J. McGuffin
BMCBI
2007
227views more  BMCBI 2007»
15 years 6 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...