Who is Who in Phylogenetic Networks

Publications related to 'planar'   Order by:   Type | Year

Only And Or     related to: --- abstract network agreement forest AIC Ancestral trait reconstruction approximation APX hard ARG bayesian BIC block realization bootstrap bound branch and bound branch length cactus graph characterization circular split system cluster containment clustering coalescent compressed network compression consensus consistency cophylogeny counting database distance between networks distinct-cluster network diversity duplication dynamic programming enumeration evaluation explicit network exponential algorithm flat FPT from binary characters from binets from clusters from continuous characters from distances from gene order from multilabeled tree from multistate characters from network from NGS data From quarnets from quartets from rooted trees from sequences from species tree from splits from trees From tri-LGT-nets from trinets from triplets from unrooted trees FU-stable network galled network galled tree generation genetically stable network haplotype network haplotyping heuristic HMM hybridization identifiability inapproximability incomplete lineage sorting integer linear programming isomorphism k-reticulated kernelization kth-order reduced network labeling lateral gene transfer level k phylogenetic network LGT network likelihood lineage sorting loss LST distance MASN median network MedianJoining minimal lateral network minimum contradiction minimum number minimum spanning network model selection mrca network MSOL mu distance nearly-stable network NeighborNet nested network netting NNI distance normal network NP complete Number of vertices optimal realization outerplanar parsimony partly reduced networks pedigree perfect phylogenetic network phylogeny polynomial population genetics Program AdmixTools Program ALE Program Angst Program Arlequin Program ARTNET Program Beagle Program BIMLR Program Bio PhyloNetwork Program BMhyd Program Clustistic Program CMPT Program CombineTrees Program ConsensusNetwork Program constNJ Program CycleKiller Program Dendroscope Program EEEP Program FastHN Program FastNet Program FlatNJ Program Fylogenetica Program GalledTree Program GraphDTL Program HapBound Program HGT_simul Program HiDe Program HorizStory Program Hybrid-coal Program Hybrid-Lambda Program HybridInterleave Program HybridNET Program HybridNumber Program Hybroscale Program icelu-PhyloNetwork Program IcyTree Program ILPEACE Program JML Program JPrIME-DLTRS Program LatTrans Program LEV1ATHAN Program Lev1Generator Program Level2 Program LGTnetwork Program lingpy Program LNetwork Program MaafB Program Marlon Program MC-Net Program McKiTscH Program Mowgli Program MowgliNNI Program MPNet Program MY CLOSURE Program Nepal Program NetGen Program NetTest Program NetView Program Network Program Notung Program PADRE Program Phangorn Program PhippsNetwork Program PhyloDAG Program PhyloNet Program PhyloNet-HMM Program PhyloNetwork Program PhyloNetworks SNaQ Program PIRN Program PopART Program Prunier Program Pyramids Program QNet Program Quartet Program Quartet Decomposition Program QuartetMethods Program QuartetNet Program QuasiDec Program QuickCass Program RANGER-DTL Program RecMin Program Recodon Program RecPars Program Reticlad Program SAGE Program SAQ-Net Program Serial NetEvolve Program SHRUB Program Simplistic Program Sliding MinPD Program SNSA Program Spectronet Program SplitsTree Program SPNet Program SPRDist Program SuperQ Program SylvX Program T REX Program TCS Program TERA Program TerminusEst Program Treeduce Program TreeFix-DTL Program TreeMix Program Treevolve Program TriLoNet Program TripNet Program ultra-Net Program Ultranet Program WeakHierarchies Program Xscape pseudo-polynomial pyramid quasi-median network realization recombination recombination detection reconstruction reduced networks regular network reticulation-visible network reticulogram serial evolutionary networks simulated annealing simulation site consistency software split split decomposition split network SPR distance spread stable-child network statistical model statistical parsimony statistical test supernetwork survey tanglegram TBR distance time consistent network tree child network tree containment tree containment. tree sibling network tree-based network tripartition distance triplet distance unicyclic network uniqueness visualization weak hierarchy weakly compatible

Associated keywords

abstract-network characterization circular-split-system explicit-network flat from-multistate-characters galled-network galled-tree NP-complete outerplanar perfect phylogenetic-network phylogeny planar polynomial reconstruction split split-network visualization

2017

1 Monika Balvociute, David Bryant and Andreas Spillner. When can splits be drawn in the plane? In SIAM Journal on Discrete Mathematics, Vol. 31(2):839-856, 2017.   Keywords: abstract network, characterization, flat, phylogenetic network, planar, split, split network. Note: http://arxiv.org/abs/1509.06104v1.

2016

2 Ioannis G. Tollis and Konstantinos G. Kakoulis. Algorithms for Visualizing Phylogenetic Networks. In GD16, Vol. 9801:183-195 of LNCS, springer, 2016.   Keywords: explicit network, galled network, galled tree, NP complete, planar, visualization. Note: http://arxiv.org/abs/1609.00755.

2015

3 Marc Thuillard and Didier Fraix-Burnet. Phylogenetic Trees and Networks Reduce to Phylogenies on Binary States: Does It Furnish an Explanation to the Robustness of Phylogenetic Trees against Lateral Transfers? In Evolutionary Bioinformatics, Vol. 11:213-221, 2015. [Abstract]   Keywords: circular split system, explicit network, from multistate characters, outerplanar, perfect, phylogenetic network, phylogeny, planar, polynomial, reconstruction, split. Note: http://dx.doi.org/10.4137%2FEBO.S28158.