Sciweavers

10 search results - page 1 / 2
» The Maximum Agreement of Two Nested Phylogenetic Networks
Sort
View
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
13 years 9 months ago
The Maximum Agreement of Two Nested Phylogenetic Networks
Jesper Jansson, Wing-Kin Sung
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 3 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
13 years 9 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
BMCBI
2010
118views more  BMCBI 2010»
13 years 3 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
JCB
2006
124views more  JCB 2006»
13 years 3 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...