In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
This paper addresses two closely related aspects of subjective information. First, no two agents necessarily see the same thing when they observe the same object. Second, no two a...
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
Chris Christiansen, Thomas Mailund, Christian N. S...