Sciweavers

83 search results - page 4 / 17
» Upper bounds on maximum likelihood for phylogenetic trees
Sort
View
ICPP
2009
IEEE
14 years 5 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
IPPS
2006
IEEE
14 years 4 months ago
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
Alexandros Stamatakis
ALGORITHMICA
1999
87views more  ALGORITHMICA 1999»
13 years 10 months ago
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
Kevin Atteson
APBC
2004
132views Bioinformatics» more  APBC 2004»
14 years 6 days ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
ICC
2008
IEEE
113views Communications» more  ICC 2008»
14 years 5 months ago
Complexity Reduction of Maximum-Likelihood Multiuser Detection (ML-MUD) Receivers with Carrier Interferometry Codes in MC-CDMA
—We propose to use carrier interferometry (CI) codes to reduce the complexity of the maximumlikelihood multiuser-detection (ML-MUD) receiver in MC-CDMA systems with carrier frequ...
Layla Tadjpour, Shang-Ho Tsai, C. C. Jay Kuo