1099 search results - page 143 / 220 » On the Complexity of Computing Evolutionary Trees |
156
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
DASFAA
2007
IEEE
15 years 4 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
106
click to vote
BMCBI
2006
14 years 10 months ago
2006
Background: Gene Ontology (GO) characterizes and categorizes the functions of genes and their products according to biological processes, molecular functions and cellular componen...
104
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
COMPLEX
2009
Springer
15 years 2 months ago
2009
Springer
Allometric scaling is an important universal property of metabolic living systems. It also describes the self-similar branching treeliked structures in transportation networks. Thi...