230 search results - page 30 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
ALENEX
2009
13 years 10 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
CPM
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Bayesian phylogenetic inference is an important alternative to maximum likelihood-based phylogenetic method. However, inferring large trees using the Bayesian approach is computat...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...