30 search results - page 4 / 6 » A 3-approximation algorithm for the subtree distance between... |
ALGORITHMICA
1999
13 years 8 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
ECML
2007
Springer
14 years 2 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
RECOMB
1997
Springer
14 years 21 days ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
BMCBI
2011
13 years 3 months ago
2011
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...