Inferring ordered trees from local constraints

MaRDI QIDQ4953346zbMATH OpenFDO

Authors Jesper Jansson, Anna Östlin, Leszek Gąsieniec, Andrzej Lingas

Publication date 14 January 2001

zbMATH Keywords

ordered local consensus tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 910861
• Computing the Local Consensus of Trees
• Determining the consistency of partial tree descriptions
• Tree reconstruction from partial orders
• scientific article; zbMATH DE number 871930

Cited in

(8)

• Determining the consistency of partial tree descriptions
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
• Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
• Approximating the level probabilities in order restricted inference: The simple tree ordering
• Tree reconstruction from partial orders
• Network construction with ordered constraints
• New results on optimizing rooted triplets consistency
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets

This page was built for publication: Inferring ordered trees from local constraints

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