scientific article; zbMATH DE number 7651142
From MaRDI portal
Publication:5874464
Recommendations
- Reconstruction of large phylogenetic trees: a parallel approach
- Parallel generation of the biological trees
- scientific article; zbMATH DE number 2086792
- Building large phylogenetic trees on coarse-grained parallel machines
- scientific article; zbMATH DE number 1956215
- Reconstructing the phylogeny: computational methods
Cites work
- scientific article; zbMATH DE number 2079368 (Why is no real title available?)
- scientific article; zbMATH DE number 1754590 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- Adaptive hierarchical clustering using ordinal queries
- An optimal algorithm to reconstruct trees from additive distance data
- Circuit and decision tree complexity of some number theoretic problems
- Constructing Computer Virus Phylogenies
- Decision tree complexity and Betti numbers
- Determining the Evolutionary Tree Using Experiments
- From query complexity to computational complexity
- Graph reconstruction and verification
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Introduction to algorithms.
- Learning a bounded-degree tree using separator queries
- On the longest path algorithm for reconstructing trees from distance matrices
- Optimal query complexity bounds for finding graphs
- Parallelism in Comparison Problems
- Probability and Computing
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- The query complexity of finding a hidden permutation
- Universality considerations in VLSI circuits
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874464)
