Generating normal networks via leaf insertion and nearest neighbor interchange
Abstract 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 and other network classes by relaxing a structural condition imposed on galled trees. Although these networks are...
Main Author: | Louxin Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-12-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | https://doi.org/10.1186/s12859-019-3209-3 |
Similar Items
-
Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
by: Suman Saha, et al.
Published: (2016-03-01) -
Tree-average distances on certain phylogenetic networks have their weights uniquely determined
by: Willson Stephen J
Published: (2012-05-01) -
ExTCKNN: Expanding Tree-Based Continuous K Nearest Neighbor Query in Road Networks With Traffic Rules
by: Hongjun Li, et al.
Published: (2018-01-01) -
Synchronizability of Multilayer Networks With K-nearest-neighbor Topologies
by: Li Zhang, et al.
Published: (2020-10-01) -
Comparison of Min-Max normalization and Z-Score Normalization in the K-nearest neighbor (kNN) Algorithm to Test the Accuracy of Types of Breast Cancer
by: Henderi Henderi, et al.
Published: (2021-03-01)