Sciweavers

76 search results - page 11 / 16
» On the maximum quartet distance between phylogenetic trees
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
PVLDB
2011
14 years 13 days ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
75
Voted
BMCBI
2007
148views more  BMCBI 2007»
14 years 9 months ago
BPhyOG: An interactive server for genome-wide inference of bacterial phylogenies based on overlapping genes
Background: Overlapping genes (OGs) in bacterial genomes are pairs of adjacent genes of which the coding sequences overlap partly or entirely. With the rapid accumulation of seque...
Yingqin Luo, Cong Fu, Da-Yong Zhang, Kui Lin
JCB
2002
108views more  JCB 2002»
14 years 9 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
COCOA
2008
Springer
14 years 11 months ago
Simplicial Powers of Graphs
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Andreas Brandstädt, Van Bang Le