1099 search results - page 4 / 220 » On the Complexity of Computing Evolutionary Trees |
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
STACS
1999
Springer
15 years 1 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
74
Voted
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
113
click to vote
IANDC
2011
14 years 4 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...