1099 search results - page 155 / 220 » On the Complexity of Computing Evolutionary Trees |
92
Voted
AIEDAM
2008
14 years 10 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
110
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
86
Voted
FTDCS
2003
IEEE
15 years 3 months ago
2003
IEEE
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
DAM
2007
14 years 10 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
BMCBI
2010
14 years 10 months ago
2010
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...