1099 search results - page 138 / 220 » On the Complexity of Computing Evolutionary Trees |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
79
Voted
AINA
2006
IEEE
15 years 2 days ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
BIOINFORMATICS
2010
14 years 10 months ago
2010
Motivation: Tumorigenesis is an evolutionary process by which tumor cells acquire sequences of mutations leading to increased growth, invasiveness, and eventually metastasis. It i...
BMCBI
2010
14 years 10 months ago
2010
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
101
click to vote
BMCBI
2005
14 years 10 months ago
2005
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...