Who is Who in Phylogenetic Networks

Publications related to 'Program BIMLR' : BIMLR is a Java program which takes as input a set of rooted phylogenetic trees in the Newick format and outputs a rooted phylogenetic networks in the extended Newick format. The approach is based on softwired clusters. Software available at http://nclab.hit.edu.cn/~wangjuan/BIMLR/   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 cherry-picking circular split system cluster containment clustering coalescent compressed network compression consensus consistency cophylogeny counting database display set distance between networks distinct-cluster network distinguishability 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 subnetworks 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 History bound 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 NNI moves normal network NP complete number of vertices optimal realization orchard network orientation outerplanar parental hybridization parsimony partly reduced networks pedigree perfect phylogenetic network phylogeny planar polynomial population genetics Program AdmixTools Program ALE Program Angst Program Arlequin Program ARTNET Program Beagle Program Bio PhyloNetwork Program BMhyd Program Clustistic Program CMPT Program CombineTrees Program ConsensusNetwork Program constNJ Program CycleKiller Program Dendroscope Program ecceTERA Program EEEP Program FastHN Program FastNet Program FlatNJ Program Frin 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 IGNet 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 PhyloSketch 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 TCGenerators 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 quasi-reticulation-visible network realization recombination recombination detection reconstruction reduced networks regular network reticulation-visible network reticulogram rigidly displaying SAT semidirected network serial evolutionary networks simulated annealing simulation site consistency software split split decomposition split network SPR distance spread stable-child network stack-free network statistical model statistical parsimony statistical test supernetwork survey tanglegram TBR distance temporal-hybridization number time consistent network tree containment tree sibling network tree-based network tree-child network tree-child sequence tripartition distance triplet distance unicyclic network uniqueness unrooted tree-based network valid network visualization weak hierarchy weakly compatible weakly displaying

Associated keywords

evaluation explicit-network from-clusters from-rooted-trees phylogenetic-network phylogeny Program-BIMLR Program-Dendroscope Program-IGNet Program-LNetwork reconstruction software survey

2019

1 Juan Wang and Maozu Guo. IGNet: Constructing Rooted Phylogenetic Networks Based on Incompatible Graphs. In ICNC-FSKD19, Vol. 1075:894-900 of Advances in Intelligent Systems and Computing, Springer, 2019.   Keywords: explicit network, from rooted trees, phylogenetic network, phylogeny, Program BIMLR, Program IGNet, Program LNetwork, reconstruction, software.

2016

2 Juan Wang. A Survey of Methods for Constructing Rooted Phylogenetic Networks. In PLoS ONE, Vol. 11(11):e0165834, 2016.   Keywords: evaluation, explicit network, from clusters, phylogenetic network, phylogeny, Program BIMLR, Program Dendroscope, Program LNetwork, reconstruction, survey. Note: http://dx.doi.org/10.1371/journal.pone.0165834.

2013

3 Juan Wang, Maozu Guo, Linlin Xing, Kai Che, Xiaoyan Liu and Chunyu Wang. BIMLR: A Method for Constructing Rooted Phylogenetic Networks from Rooted Phylogenetic Trees. In Gene, Vol. 527(1):344-351, 2013.   Keywords: explicit network, from clusters, from rooted trees, phylogenetic network, phylogeny, Program BIMLR, Program Dendroscope, reconstruction, software.         Toggle abstract "Rooted phylogenetic trees constructed from different datasets (e.g. from different genes) are often conflicting with one another, i.e. they cannot be integrated into a single phylogenetic tree. Phylogenetic networks have become an important tool in molecular evolution, and rooted phylogenetic networks are able to represent conflicting rooted phylogenetic trees. Hence, the development of appropriate methods to compute rooted phylogenetic networks from rooted phylogenetic trees has attracted considerable research interest of late. The CASS algorithm proposed by van Iersel et al. is able to construct much simpler networks than other available methods, but it is extremely slow, and the networks it constructs are dependent on the order of the input data. Here, we introduce an improved CASS algorithm, BIMLR. We show that BIMLR is faster than CASS and less dependent on the input data order. Moreover, BIMLR is able to construct much simpler networks than almost all other methods. BIMLR is available at http://nclab.hit.edu.cn/wangjuan/BIMLR/. © 2013 Elsevier B.V."