Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees

DOI10.1137/S0097539797332275zbMath0963.05033OpenAlexW1969781519MaRDI QIDQ4507366

Wing-Kin Sung, Hing-Fung Ting, Tak-Wah Lam, Ming-Yang Kao

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797332275

zbMATH Keywords

evolutionary treeagreement subtreemixed treeall-cavity maximum weight matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) General biology and biomathematics (92B05)

Related Items (2)

Approximate labelled subtree homeomorphism ⋮ APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES

This page was built for publication: Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees