654 search results - page 59 / 131 » On the Approximation of Computing Evolutionary Trees |
100
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: It has been suggested previously that genome and proteome sequences show characteristics typical of natural-language texts such as “signature-style” word usage ind...
116
click to vote
CVPR
2012
IEEE
13 years 7 days ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
JMLR
2010
14 years 4 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
BICOB
2009
Springer
15 years 4 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...