Research in Computational Molecular Biology

DOI10.1007/b135594zbMath1119.92354OpenAlexW4376539797MaRDI QIDQ5706869

Wing-Kin Sung, Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen

Publication date: 23 November 2005

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

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

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Related Items

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable ⋮ Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ When two trees go to war ⋮ Fast algorithms for computing the tripartition-based distance between phylogenetic networks