785 search results - page 49 / 157 » Binary Join Trees |
RECOMB
2008
Springer
15 years 10 months ago
2008
Springer
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
119
click to vote
COMBINATORICA
2011
13 years 9 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...