Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
NetRAX: accurate and fast maximum likelihood phylogenetic network inference
Motivation Phylogenetic networks can represent non-treelike evolutionary scenarios.
Current, actively developed approaches for phylogenetic network inference jointly account …
Current, actively developed approaches for phylogenetic network inference jointly account …
[HTML][HTML] Inferring phylogenetic networks from multifurcating trees via cherry picking and machine learning
The Hybridization problem asks to reconcile a set of conflicting phylogenetic trees into a
single phylogenetic network with the smallest possible number of reticulation nodes. This …
single phylogenetic network with the smallest possible number of reticulation nodes. This …
Advancing admixture graph estimation via maximum likelihood network orientation
Motivation Admixture, the interbreeding between previously distinct populations, is a
pervasive force in evolution. The evolutionary history of populations in the presence of …
pervasive force in evolution. The evolutionary history of populations in the presence of …
Comparing the topology of phylogenetic network generators
Phylogenetic networks represent evolutionary history of species and can record natural
reticulate evolutionary processes such as horizontal gene transfer and gene recombination …
reticulate evolutionary processes such as horizontal gene transfer and gene recombination …
Counting phylogenetic networks of level 1 and 2
M Bouvel, P Gambette, M Mansouri - Journal of mathematical biology, 2020 - Springer
Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to
describe evolution in the case of transfer of genetic material between coexisting species …
describe evolution in the case of transfer of genetic material between coexisting species …
RF-Net 2: Fast inference of virus reassortment and hybridization networks
Motivation A phylogenetic network is a powerful model to represent entangled evolutionary
histories with both divergent (speciation) and convergent (eg hybridization, reassortment …
histories with both divergent (speciation) and convergent (eg hybridization, reassortment …
Generating normal networks via leaf insertion and nearest neighbor interchange
L Zhang - BMC bioinformatics, 2019 - Springer
Background Galled trees are studied as a recombination model in theoretical population
genetics. This class of phylogenetic networks has been generalized to tree-child networks …
genetics. This class of phylogenetic networks has been generalized to tree-child networks …
Exploring spaces of semi-directed level-1 networks
Semi-directed phylogenetic networks have recently emerged as a class of phylogenetic
networks sitting between rooted (directed) and unrooted (undirected) phylogenetic networks …
networks sitting between rooted (directed) and unrooted (undirected) phylogenetic networks …
The burning number of directed graphs: bounds and computational complexity
R Janssen - arxiv preprint arxiv:2001.03381, 2020 - arxiv.org
The burning number of a graph was recently introduced by Bonato et al. Although they
mention that the burning number generalises naturally to directed graphs, no further …
mention that the burning number generalises naturally to directed graphs, no further …
Treewidth of display graphs: bounds, brambles and applications
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display
graphs are created by identifying common leaf labels in two or more phylogenetic trees or …
graphs are created by identifying common leaf labels in two or more phylogenetic trees or …