205 search results - page 6 / 41 » Incomparability of Results Between Phylogenetic Search Progr... |
BMCBI
2006
14 years 9 months ago
2006
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
107
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
CHI
2010
ACM
15 years 4 months ago
2010
ACM
The ready availability of online source code examples has changed the cost structure of programming by example modification. However, current search tools are wholly separate from...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
101
click to vote
ICALP
2011
Springer
14 years 27 days ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...