ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی

DOI10.22055/JAMM.2021.35124.1860MaRDI QIDQ5037338zbMATH OpenOpenAlexFDO

Authors Hadi Poormohammadi, Mohsen Sardari Zarchi, Mohamad Ali Sehati, Mohamad Mirabi, Seyaed Hasan Mortazavi Zarch

Publication date 28 February 2022

Full work available at URL https://jamm.scu.ac.ir/article_16755_c19001bf23d4094fb9617a88c0f71227.pdf

zbMATH Keywords

bioinformaticsbiological sequenceMRTC problemrooted phylogenetic treerooted triplet

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15)

Recommendations

• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Algorithms for combining rooted triplets into a galled phylogenetic network
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
• Computing the rooted triplet distance between phylogenetic networks
• Computing the rooted triplet distance between phylogenetic networks
• An efficient algorithm for the rooted triplet distance between galled trees
• Computing and Combinatorics
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Constructing the maximum consensus tree from rooted Triples

Cited in

(2)

• NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
• An efficient algorithm for the rooted triplet distance between galled trees

This page was built for publication: ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی

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