Scanning Phylogenetic Networks Is NP-hard.
Vincent BerryCéline ScornavaccaMathias WellerPublished in: SOFSEM (2020)
Keyphrases
- np hard
- horizontal gene transfer
- lower bound
- scheduling problem
- network structure
- np hardness
- optimal solution
- approximation algorithms
- np complete
- linear programming
- machine learning
- network size
- worst case
- special case
- computational complexity
- social networks
- complex networks
- integer programming
- network analysis
- minimum cost
- cellular networks
- greedy heuristic
- image processing
- data sets
- remains np hard