High-performance algorithm engineering for computational phylogenetics
From MaRDI portal
Publication:1610603
DOI10.1023/A:1014362705613zbMath1007.92028OpenAlexW2129212865MaRDI 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 rearrangementhigh-performance computingcomputational genomicsphylogeny reconstructionsorting by reversalsbreak-point analysis
Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Computational methods for problems pertaining to biology (92-08)
Related Items (3)
On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction ⋮ Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? ⋮ A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Uses Software
This page was built for publication: High-performance algorithm engineering for computational phylogenetics
