Reconstruction of large phylogenetic trees: a parallel approach
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086792
- Building large phylogenetic trees on coarse-grained parallel machines
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- Molecular phylogenetics: parallelized parameter estimation and quartet puzzling.
- Euro-Par 2004 Parallel Processing
Cites work
Cited in
(14)- Parallel implementation of DNAml program on message-passing architectures
- Molecular phylogenetics: parallelized parameter estimation and quartet puzzling.
- Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
- Building large phylogenetic trees on coarse-grained parallel machines
- ParBaum: Large-scale maximum likelihood-based phylogenetic analyses
- Adapting PAxML to the Hitachi SR8000-F1 Supercomputer
- scientific article; zbMATH DE number 2086792 (Why is no real title available?)
- Parallel Evolutionary Registration of Range Data
- Euro-Par 2004 Parallel Processing
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- scientific article; zbMATH DE number 7651142 (Why is no real title available?)
- A scalable parallelization of the gene duplication problem
- Large scale multiple sequence alignment with simultaneous phylogeny inference
- Establishing a statistic model for recognition of steroid hormone response elements
This page was built for publication: Reconstruction of large phylogenetic trees: a parallel approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500323)