Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.92324OpenAlexW2494705596MaRDI QIDQ5492860

Jesper Jansson, Ho-Leung Chan, Tak-Wah Lam, Siu-Ming Yiu

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ Constructing tree-child networks from distance matrices ⋮ Identifiability of local and global features of phylogenetic networks from average distances

This page was built for publication: Mathematical Foundations of Computer Science 2005