Reconstructing semi-directed level-1 networks using few quarnets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1754590 (Why is no real title available?)
- An algorithm for reconstructing level-2 phylogenetic networks from trinets
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Constructing optimal trees from quartets
- Determining the Evolutionary Tree Using Experiments
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Distinguishing phylogenetic networks
- Identifiability in phylogenetics using algebraic matroids
- Identifiability of level-1 species networks from gene tree quartets
- Identifiability of local and global features of phylogenetic networks from average distances
- Identifying circular orders for blobs in phylogenetic networks
- Identifying species network features from gene tree quartets under the coalescent model
- Inferring evolutionary trees with strong combinatorial evidence
- Quarnet inference rules for level-1 networks
- Reconstructing a phylogenetic level-1 network from quartets
- The tree of blobs of a species network: identifiability under the coalescent
This page was built for publication: Reconstructing semi-directed level-1 networks using few quarnets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987101)