Sciweavers

654 search results - page 30 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 5 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
BMCBI
2010
118views more  BMCBI 2010»
14 years 9 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...
ICCS
2005
Springer
15 years 3 months ago
Phylogenetic Networks, Trees, and Clusters
Phylogenetic networks model evolutionary histories in the presence of non-treelike events such as hybrid speciation and horizontal gene transfer. In spite of their widely acknowled...
Luay Nakhleh, Li-San Wang
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
RECOMB
2005
Springer
15 years 10 months ago
Stability of Rearrangement Measures in the Comparison of Genome Sequences
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
David Sankoff, Matthew Mazowita