ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Conference on Parallel Processing

• Publication date

  2006-08-14

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1109/ICPP.2006.40
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Molecular Evolution and Phylogenetics

  2008cited by this paper
• Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions

  2006cited by this paper
• The pairing heap: A new form of self-adjusting heap

  2005cited by this paper
• High-performance algorithms for phylogeny reconstruction with maximum parsimony

  2004cited by this paper
• MacClade 4: analysis of phy-logeny and character evolution

  2003cited by this paper
• Simulated Evolutionary Optimization and Local Search: Introduction and Application to Tree Search

  2001influential reference
• Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees

  2000cited by this paper
• The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis

  1999cited by this paper
• Fast Fitch‐Parsimony Algorithms for Large Data Sets

  1998influential reference
• Lock bypassing: an efficient algorithm for concurrently accessing priority heaps

  1998cited by this paper
• The Art of Computer Programming: Volume 3: Sorting and Searching

  1998cited by this paper
• The Disk-covering Method for Tree Reconstruction

  1998cited by this paper
• Building a parallel branch and bound library

  1996cited by this paper
• Concurrent Data Structures for Tree Search Algorithms

  1995cited by this paper
• On Irregular Data Structures and Asynchronous Parallel Brand and Bound Algorithms

  1994cited by this paper
• PAUP:Phylogenetic analysis using parsi-mony

  1993influential reference
• Load balancing for distributed branch & bound algorithms

  1992influential reference
• Concurrent Access of Priority Queues

  1988cited by this paper
• Simultaneous Update of Priority Structures

  1987cited by this paper
• Reconstructing ancestral character states under Wagner parsimony

  1987cited by this paper
• An empirical comparison of priority-queue and event-set implementations

  1986cited by this paper
• Self-adjusting binary search trees

  1985cited by this paper
• Branch and bound algorithms to determine minimal evolutionary trees

  1982cited by this paper
• On the Problem of Discovering the Most Parsimonious Tree

  1977cited by this paper
• Theoretical comparisons of search strategies in branch-and-bound algorithms

  1976cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper
• Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology

  1971influential reference
• Methods for Computing Wagner Trees

  1970cited by this paper
• Atlas of protein sequence and structure

  1965cited by this paper

• RAxML-CELL: Parallel Phylogenetic Tree Construction on the Cell Broadband Engine

  2018cites this paper
• Live phylogeny with polytomies: Finding the most compact parsimonious trees

  2017cites this paper
• Accelerating the phylogenetic parsimony function on heterogeneous systems

  2017cites this paper
• Advanced methods to solve the maximum parsimony problem. (Méthodes avancées pour la résolution du problème de maximum parcimonie)

  2016cites this paper
• Using mixed mode programming to parallelize an indicator-based evolutionary algorithm for inferring multiobjective phylogenetic histories

  2016influential citation
• Most Compact Parsimonious Trees

  2016cites this paper
• A Brief Review to Phylogenetic Reconstruction by Maximum Parsimony

  2015cites this paper
• Computer science and parsimony: a reappraisal, with discussion of methods for poorly structured datasets

  2015cites this paper
• FSA: A Fast Stepwise Addition Algorithm for Constructing Phylogenetic Trees

  2014cites this paper
• A bottom-up implementation of Path-Relinking for Phylogenetic reconstruction applied to Maximum Parsimony

  2014cites this paper
• Faster exact maximum parsimony search with XMP

  2011cites this paper
• SWARM: A Parallel Programming Framework for Multicore Processors

  2007cites this paper
• Parallelization of the maximum likelihood approach to phylogenetic inference

  2007cites this paper
• RAxML-Cell: Parallel Phylogenetic Tree Inference on the Cell Broadband Engine

  2007cites this paper
• High-performance Computing Methods for Computational Genomics

  2006cites this paper
• Computing Methods for Computational Genomics

  2006cites this paper