Sciweavers

1158 search results - page 5 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Hybrid MPI/Pthreads parallelization of the RAxML phylogenetics code
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
Wayne Pfeiffer, Alexandros Stamatakis
MFCS
2005
Springer
14 years 27 days ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
RECOMB
2006
Springer
14 years 7 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...
ALGORITHMICA
2011
13 years 2 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Sergio Cabello, Bojan Mohar