All that glisters is not galled
From MaRDI portal
Publication:733254
DOI10.1016/j.mbs.2009.06.007zbMath1172.92370OpenAlexW2963026941WikidataQ51814874 ScholiaQ51814874MaRDI QIDQ733254
Gabriel Valiente, Francesc Rosselló
Publication date: 15 October 2009
Published in: Mathematical Biosciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mbs.2009.06.007
Related Items (10)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Identifiability of species network topologies from genomic sequences using the logDet distance ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ Uprooted phylogenetic networks ⋮ Computing consensus networks for collections of 1-nested phylogenetic networks ⋮ The space of equidistant phylogenetic cactuses ⋮ Computing the rooted triplet distance between galled trees by counting triangles ⋮ On encodings of phylogenetic networks of bounded level ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Identifying species network features from gene tree quartets under the coalescent model
Cites Work
- Reconstructing evolution of sequences subject to recombination using parsimony
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Fixed topology alignment with recombination
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Computing the maximum agreement of phylogenetic networks
- The Fine Structure of Galls in Phylogenetic Networks
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Algorithms and Computation
This page was built for publication: All that glisters is not galled
