The Structure of Level-k Phylogenetic Networks

DOI10.1007/978-3-642-02441-2_26MaRDI QIDQ3637120zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Philippe Gambette, Vincent Berry, Christophe Paul

Publication date 7 July 2009

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02441-2_26

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Systems biology, networks (92C42) Problems related to evolution (92D15)

Recommendations

• Counting phylogenetic networks of level 1 and 2
• Constructing the simplest possible phylogenetic network from triplets
• Constructing the Simplest Possible Phylogenetic Network from Triplets
• A branching process approach to level‐k phylogenetic networks
• Binets: fundamental building blocks for phylogenetic networks

Cites work

• Computing the maximum agreement of phylogenetic networks
• Constructing the Simplest Possible Phylogenetic Network from Triplets
• Graph isomorphism problem
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
• Logical description of context-free graph languages
• On the complexity of polytope isomorphism problems
• Properties of a neutral allele model with intragenic recombination
• Research in Computational Molecular Biology
• Seeing the trees and their branches in the network is hard
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• The On-Line Encyclopedia of Integer Sequences
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

Cited in

(11)

• Reconstructibility of unrooted level-k phylogenetic networks from distances
• Counting phylogenetic networks of level 1 and 2
• Trinets encode tree-child and level-2 phylogenetic networks
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
• Transforming phylogenetic networks: moving beyond tree space
• Do branch lengths help to locate a tree in a phylogenetic network?
• On encodings of phylogenetic networks of bounded level
• The SNPR neighbourhood of tree-child networks
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• A branching process approach to level‐k phylogenetic networks
• Dimensions of level-1 group-based phylogenetic networks

Describes a project that uses

Uses Software

• OEIS
• Recodon

This page was built for publication: The Structure of Level-k Phylogenetic Networks

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