431 search results - page 61 / 87 » Drawing Phylogenetic Trees |
100
click to vote
COLING
2010
14 years 6 months ago
2010
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
102
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
102
click to vote
ACL
2009
14 years 9 months ago
2009
We would like to draw attention to Hidden Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly suc...
RECOMB
2006
Springer
16 years 5 days ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
120
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...