A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance.
Guohua JinLuay NakhlehSagi SnirTamir TullerPublished in: ISBRA (2007)
Keyphrases
- worst case
- theoretical analysis
- upper bound
- horizontal gene transfer
- network structure
- lower bound
- error bounds
- convex combinations
- complex systems
- network size
- finite sample
- confidence bounds
- data structure
- upper and lower bounds
- generalization bounds
- uniform convergence
- social networks
- complex networks
- computer networks
- neural network
- network analysis
- heterogeneous networks
- empirical risk minimization
- bayesian networks