Sciweavers

1060 search results - page 73 / 212
» On the Discovery of Random Trees
Sort
View
BMCBI
2005
100views more  BMCBI 2005»
14 years 10 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...
TCS
2002
14 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
IJBRA
2010
108views more  IJBRA 2010»
14 years 7 months ago
Assessing and improving the accuracy of detecting protein adaptation with the TreeSAAP analytical software
The TreeSAAP software has been successfully used in a variety of protein studies for identifying and characterizing adaptation in terms of shifts in the physicochemical properties ...
David A. McClellan, David D. Ellison
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 4 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
ICPPW
1999
IEEE
15 years 2 months ago
Performance Evaluation of Public-Key Certificate Revocation System with Balanced Hash Tree
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Hiroaki Kikuchi, Kensuke Abe, Shohachiro Nakanishi