Sciweavers

735 search results - page 38 / 147
» A Mechanization of Phylogenetic Trees
Sort
View
IPL
2006
72views more  IPL 2006»
15 years 6 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 11 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
UAI
2008
15 years 7 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
ISBRA
2010
Springer
16 years 18 days ago
Uncovering Hidden Phylogenetic Consensus
Abstract. Many of the steps in phylogenetic reconstruction can be confounded by “rogue” taxa, taxa that cannot be placed with assurance anywhere within the tree—whose locatio...
Nicholas D. Pattengale, Krister M. Swenson, Bernar...
RECOMB
2009
Springer
16 years 26 days ago
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
Constantinos Daskalakis, Elchanan Mossel, Sé...