208 related articles for article (PubMed ID: 23680992)
1. Trinets encode tree-child and level-2 phylogenetic networks.
van Iersel L; Moulton V
J Math Biol; 2014 Jun; 68(7):1707-29. PubMed ID: 23680992
[TBL] [Abstract][Full Text] [Related]
2. Trinets encode orchard phylogenetic networks.
Semple C; Toft G
J Math Biol; 2021 Aug; 83(3):28. PubMed ID: 34420100
[TBL] [Abstract][Full Text] [Related]
3. Tree-based unrooted nonbinary phylogenetic networks.
Hendriksen M
Math Biosci; 2018 Aug; 302():131-138. PubMed ID: 29932953
[TBL] [Abstract][Full Text] [Related]
4. Tree-based networks: characterisations, metrics, and support trees.
Pons JC; Semple C; Steel M
J Math Biol; 2019 Mar; 78(4):899-918. PubMed ID: 30283985
[TBL] [Abstract][Full Text] [Related]
5. Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models.
Chauve C; Ponty Y; Wallner M
J Math Biol; 2020 Apr; 80(5):1353-1388. PubMed ID: 32060618
[TBL] [Abstract][Full Text] [Related]
6. Classes of explicit phylogenetic networks and their biological and mathematical significance.
Kong S; Pons JC; Kubatko L; Wicke K
J Math Biol; 2022 May; 84(6):47. PubMed ID: 35503141
[TBL] [Abstract][Full Text] [Related]
7. Caterpillars on three and four leaves are sufficient to reconstruct binary normal networks.
Linz S; Semple C
J Math Biol; 2020 Nov; 81(4-5):961-980. PubMed ID: 32909104
[TBL] [Abstract][Full Text] [Related]
8. Binets: Fundamental Building Blocks for Phylogenetic Networks.
van Iersel L; Moulton V; de Swart E; Wu T
Bull Math Biol; 2017 May; 79(5):1135-1154. PubMed ID: 28386669
[TBL] [Abstract][Full Text] [Related]
9. Reconciling event-labeled gene trees with MUL-trees and species networks.
Hellmuth M; Huber KT; Moulton V
J Math Biol; 2019 Oct; 79(5):1885-1925. PubMed ID: 31410552
[TBL] [Abstract][Full Text] [Related]
10. How much information is needed to infer reticulate evolutionary histories?
Huber KT; Van Iersel L; Moulton V; Wu T
Syst Biol; 2015 Jan; 64(1):102-11. PubMed ID: 25236959
[TBL] [Abstract][Full Text] [Related]
11. NCHB: A method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization.
Poormohammadi H; Zarchi MS; Ghaneai H
J Theor Biol; 2020 Mar; 489():110144. PubMed ID: 31911141
[TBL] [Abstract][Full Text] [Related]
12. Forest-Based Networks.
Huber KT; Moulton V; Scholz GE
Bull Math Biol; 2022 Sep; 84(10):119. PubMed ID: 36107279
[TBL] [Abstract][Full Text] [Related]
13. Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.
Yu Y; Warnow T; Nakhleh L
J Comput Biol; 2011 Nov; 18(11):1543-59. PubMed ID: 22035329
[TBL] [Abstract][Full Text] [Related]
14. Generating normal networks via leaf insertion and nearest neighbor interchange.
Zhang L
BMC Bioinformatics; 2019 Dec; 20(Suppl 20):642. PubMed ID: 31842746
[TBL] [Abstract][Full Text] [Related]
15. Uprooted Phylogenetic Networks.
Gambette P; Huber KT; Scholz GE
Bull Math Biol; 2017 Sep; 79(9):2022-2048. PubMed ID: 28762018
[TBL] [Abstract][Full Text] [Related]
16. Orchard Networks are Trees with Additional Horizontal Arcs.
van Iersel L; Janssen R; Jones M; Murakami Y
Bull Math Biol; 2022 Jun; 84(8):76. PubMed ID: 35727410
[TBL] [Abstract][Full Text] [Related]
17. Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves.
Janssen R; Jones M; Erdős PL; van Iersel L; Scornavacca C
Bull Math Biol; 2018 Aug; 80(8):2177-2208. PubMed ID: 29948885
[TBL] [Abstract][Full Text] [Related]
18. A decomposition theory for phylogenetic networks and incompatible characters.
Gusfield D; Bansal V; Bafna V; Song YS
J Comput Biol; 2007 Dec; 14(10):1247-72. PubMed ID: 18047426
[TBL] [Abstract][Full Text] [Related]
19. Not all phylogenetic networks are leaf-reconstructible.
Erdős PL; van Iersel L; Jones M
J Math Biol; 2019 Oct; 79(5):1623-1638. PubMed ID: 31363828
[TBL] [Abstract][Full Text] [Related]
20. When is a Phylogenetic Network Simply an Amalgamation of Two Trees?
Semple C; Simpson J
Bull Math Biol; 2018 Sep; 80(9):2338-2348. PubMed ID: 29981001
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]