Sciweavers

292 search results - page 29 / 59
» An Experimental Analysis of Robinson-Foulds Distance Matrix ...
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
JCB
2006
124views more  JCB 2006»
13 years 7 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
ICPR
2004
IEEE
14 years 8 months ago
Relevant Linear Feature Extraction Using Side-information and Unlabeled Data
"Learning with side-information" is attracting more and more attention in machine learning problems. In this paper, we propose a general iterative framework for relevant...
Changshui Zhang, Fei Wu, Yonglei Zhou
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 4 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
ISLPED
1998
ACM
94views Hardware» more  ISLPED 1998»
13 years 11 months ago
Theoretical bounds for switching activity analysis in finite-state machines
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
Diana Marculescu, Radu Marculescu, Massoud Pedram