These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
179 related articles for article (PubMed ID: 29451395)
1. Determining the Consistency of Resolved Triplets and Fan Triplets. Jansson J; Lingas A; Rajaby R; Sung WK J Comput Biol; 2018 Jul; 25(7):740-754. PubMed ID: 29451395 [TBL] [Abstract][Full Text] [Related]
2. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees. Jansson J; Rajaby R; Sung WK J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336 [No Abstract] [Full Text] [Related]
3. Phylogenetic Flexibility via Hall-Type Inequalities and Submodularity. Huber KT; Moulton V; Steel M Bull Math Biol; 2019 Feb; 81(2):598-617. PubMed ID: 29589255 [TBL] [Abstract][Full Text] [Related]
4. Computing a smallest multilabeled phylogenetic tree from rooted triplets. Guillemot S; Jansson J; Sung WK IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243 [TBL] [Abstract][Full Text] [Related]
5. A More Practical Algorithm for the Rooted Triplet Distance. Jansson J; Rajaby R J Comput Biol; 2017 Feb; 24(2):106-126. PubMed ID: 27983874 [TBL] [Abstract][Full Text] [Related]
6. Testing the agreement of trees with internal labels. Fernández-Baca D; Liu L Algorithms Mol Biol; 2021 Dec; 16(1):22. PubMed ID: 34863219 [TBL] [Abstract][Full Text] [Related]
7. CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem. Poor Mohammadi H; Sardari Zarchi M Iran J Biotechnol; 2020 Jul; 18(3):e2557. PubMed ID: 33850946 [TBL] [Abstract][Full Text] [Related]
8. Reconstructing a phylogenetic level-1 network from quartets. Keijsper JC; Pendavingh RA Bull Math Biol; 2014 Oct; 76(10):2517-41. PubMed ID: 25234337 [TBL] [Abstract][Full Text] [Related]
9. On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters. Gambette P; Huber KT; Kelk S J Math Biol; 2017 Jun; 74(7):1729-1751. PubMed ID: 27800561 [TBL] [Abstract][Full Text] [Related]
15. An efficient algorithm for testing the compatibility of phylogenies with nested taxa. Deng Y; Fernández-Baca D Algorithms Mol Biol; 2017; 12():7. PubMed ID: 28331536 [TBL] [Abstract][Full Text] [Related]
16. Best match graphs. Geiß M; Chávez E; González Laffitte M; López Sánchez A; Stadler BMR; Valdivia DI; Hellmuth M; Hernández Rosales M; Stadler PF J Math Biol; 2019 Jun; 78(7):2015-2057. PubMed ID: 30968198 [TBL] [Abstract][Full Text] [Related]
17. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Baste J; Paul C; Sau I; Scornavacca C Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121 [TBL] [Abstract][Full Text] [Related]