scientific article; zbMATH DE number 7205098
From MaRDI portal
Publication:5111799
DOI10.4230/LIPICS.WABI.2017.9zbMATH Open1443.92127MaRDI QIDQ5111799FDOQ5111799
Maxime Crochemore, Solon P. Pissis, Alexandre P. Francisco, Cátia Vaz
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Linear work suffix array construction
- Lowest common ancestors in trees and directed acyclic graphs
- Suffix Arrays: A New Method for On-Line String Searches
- Space Efficient Linear Time Construction of Suffix Arrays
- Introduction to evolutionary genomics
Cited In (4)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS 👍 👎
- On the linear-cost subtree-transfer distance between phylogenetic trees 👍 👎
- On the complexity of computing MP distance between binary phylogenetic trees 👍 👎
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm 👍 👎
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks 👍 👎
- Faster computation of the Robinson-Foulds distance between phylogenetic networks 👍 👎
- On the fixed parameter tractability of agreement-based phylogenetic distances 👍 👎
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 Q5111799)
