324 search results - page 52 / 65 » Distance Approximating Trees: Complexity and Algorithms |
WABI
2004
Springer
2004
Springer
Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data
14 years 21 days ago
In the last few years, it has become routine to use gene-order data to reconstruct phylogenies, both in terms of edge distances (parsimonious sequences of operations that transform...
JMLR
2008
13 years 7 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
ECCC
2011
13 years 2 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
TVCG
2012
11 years 9 months ago
2012
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...