scientific article; zbMATH DE number 7651142
From MaRDI portal
Publication:5874464
DOI10.4230/LIPICS.ESA.2020.3MaRDI QIDQ5874464FDOQ5874464
Authors: Ramtin Afshar, Pedro Matias, Martha Carolina Osegueda, Michael T. Goodrich 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.15259
Title of this publication is not available (Why is that?)
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
data structureshierarchical clusteringparallel algorithmsprivacyphylogenetic treestree reconstruction
Cites Work
- Introduction to algorithms.
- A fast algorithm for constructing trees from distance matrices
- Parallelism in Comparison Problems
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Probability and Computing
- Decision tree complexity and Betti numbers
- Title not available (Why is that?)
- Determining the Evolutionary Tree Using Experiments
- Universality considerations in VLSI circuits
- The Query Complexity of Finding a Hidden Permutation
- From query complexity to computational complexity
- Optimal query complexity bounds for finding graphs
- Constructing Computer Virus Phylogenies
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Graph Reconstruction and Verification
- An optimal algorithm to reconstruct trees from additive distance data
- Title not available (Why is that?)
- On the longest path algorithm for reconstructing trees from distance matrices
- Title not available (Why is that?)
- Circuit and decision tree complexity of some number theoretic problems
- Learning a Bounded-Degree Tree Using Separator Queries
Cited In (3)
Uses Software
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)
