Sciweavers

712 search results - page 50 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 4 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
SPAA
2005
ACM
15 years 8 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
JACM
2006
99views more  JACM 2006»
15 years 2 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
115
Voted
SAC
2004
ACM
15 years 8 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
IWAN
2000
Springer
15 years 6 months ago
An Approach for Heterogeneous Video Multicast Using Active Networking
Abstract. We present a framework for heterogeneous video multicasting, considering an active network in which active nodes can filter the video stream to satisfy different quality ...
Héctor Akamine, Naoki Wakamiya, Masayuki Mu...