Sciweavers

44 search results - page 8 / 9
» On the maximum number of edges in topological graphs with no...
Sort
View
BMCBI
2008
116views more  BMCBI 2008»
13 years 8 months ago
Algorithm of OMA for large-scale orthology inference
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Alexander C. J. Roth, Gaston H. Gonnet, Christophe...
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
GD
2008
Springer
13 years 9 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 10 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
ALGOSENSORS
2009
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal