Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,383
Self-adjusting binary search trees
, 1985
"... The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an am ..."
Abstract
-
Cited by 432 (18 self)
- Add to MetaCart
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have
Skip Lists: A Probabilistic Alternative to Balanced Trees
, 1990
"... Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. ..."
Abstract
-
Cited by 412 (1 self)
- Add to MetaCart
Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
The grid file: an adaptable, symmetric multikey file structure
- In Trends in Information Processing Systems, Proc. 3rd ECZ Conference, A. Duijvestijn and P. Lockemann, Eds., Lecture Notes in Computer Science 123
, 1981
"... Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access. They manifest various deficiencies in particular for multikey access to highly dynamic files. We study the dynamic aspects of ..."
Abstract
-
Cited by 426 (4 self)
- Add to MetaCart
partition of the search space and of a grid directory, which are the keys to a dynamic file structure called the grid file. This tile system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper hound of two disk accesses for single record retrieval; it also handles
The Determinants of Credit Spread Changes.
- Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract
-
Cited by 422 (2 self)
- Add to MetaCart
, Stanton, and Whitelaw (1997), who find that a 3-factor model explains over 90 percent of Ginnie Mae yields, but that the remaining variation apparently cannot be explained by the changes in the yield curve. 2 In contrast, our multiple-factor model explains only about one-quarter of the variation in credit
Simple fast algorithms for the editing distance between trees and related problems
- SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract
-
Cited by 405 (12 self)
- Add to MetaCart
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching
Extending the Database Relational Model to Capture More Meaning
- ACM Transactions on Database Systems
, 1979
"... During the last three or four years several investigators have been exploring “semantic models ” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can beha ..."
Abstract
-
Cited by 338 (2 self)
- Add to MetaCart
to support certain atomic and molecular semantics. These extensions represent a synthesis of many ideas from the published work in semantic modeling plus the introduction of new rules for insertion, update, and deletion, as well as new algebraic operators.
The diploid genome sequence of an individual human
- PLoS Biol
"... Presented here is a genome sequence of an individual human. It was produced from;32 million random DNA fragments, sequenced by Sanger dideoxy technology and assembled into 4,528 scaffolds, comprising 2,810 million bases (Mb) of contiguous sequence with approximately 7.5-fold coverage for any given r ..."
Abstract
-
Cited by 293 (6 self)
- Add to MetaCart
.1 million DNA variants, encompassing 12.3 Mb. These variants (of which 1,288,319 were novel) included 3,213,401 single nucleotide polymorphisms (SNPs), 53,823 block substitutions (2–206 bp), 292,102 heterozygous insertion/deletion events (indels)(1–571 bp), 559,473 homozygous indels (1–82,711 bp), 90
Making data structures persistent
, 1989
"... This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in the sense that a change to the structure destroys the old version, leaving only the new version available for use. In contrast, a persistent structure allows access to any version, old or new, at any t ..."
Abstract
-
Cited by 277 (6 self)
- Add to MetaCart
time. We develop simple, systematic, and efftcient techniques for making linked data structures persistent. We use our techniques to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion times and O (1) space bounds for insertion and deletion.
Cardiovascular Diabetology BioMed Central Original investigation
, 2003
"... The insertion/deletion variation in the α2B-adrenoceptor does not seem to modify the risk for acute myocardial infarction, but may modify the risk for hypertension in sib-pairs from families with type 2 diabetes ..."
Abstract
- Add to MetaCart
The insertion/deletion variation in the α2B-adrenoceptor does not seem to modify the risk for acute myocardial infarction, but may modify the risk for hypertension in sib-pairs from families with type 2 diabetes
Identification of protein coding regions by database similarity search
- Nature Genetics
, 1993
"... Correspondence should be addressed to W.G. page 1 Summary Sequence similarity between a translated nucleotide sequence and a known biological protein can provide strong evidence for the presence of a homologous coding region, and such similarities can often be identified even between distantly relat ..."
Abstract
-
Cited by 262 (2 self)
- Add to MetaCart
characterized the sensitivity of BLASTX recognition to the presence of substitution, insertion and deletion errors in the query sequence and to sequence divergence. Reading frames were reliably identified in the presence of 1 % query errors, a rate that is typical for primary nucleotide sequence data. BLASTX
Results 1 - 10
of
7,383
