Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The tree nearest on average to a given set of trees

From MaRDI portal
Publication:764407
Jump to:navigation, search

DOI10.1134/S0032946011030069zbMATH Open1236.05062OpenAlexW2161449154MaRDI QIDQ764407FDOQ764407


Authors: Konstantin Yu. Gorbunov, Vassily Lyubetsky Edit this on Wikidata


Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946011030069




Recommendations

  • Optimal algorithms for comparing trees with labeled leaves
  • A fast algorithm for constructing trees from distance matrices
  • scientific article; zbMATH DE number 871930
  • From Gene Trees to Species Trees
  • On computing the nearest neighbor interchange distance


zbMATH Keywords

global minimum of a functional on a tree space


Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: The tree nearest on average to a given set of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764407)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:764407&oldid=12688196"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 10:26. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki