High-performance algorithm engineering for computational phylogenetics
From MaRDI portal
Publication:1610603
DOI10.1023/A:1014362705613zbMath1007.92028MaRDI QIDQ1610603
Bernard M. E. Moret, David A. Bader, Tandy J. Warnow
Publication date: 20 August 2002
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014362705613
genome rearrangement; high-performance computing; computational genomics; phylogeny reconstruction; sorting by reversals; break-point analysis
92D15: Problems related to evolution
68W05: Nonnumerical algorithms
92-08: Computational methods for problems pertaining to biology
Related Items
Rearrangements in Phylogenetic Inference: Compare, Model, or Encode?, On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction, A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Uses Software