Name
Title | ||
|---|---|---|
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. |
Abstract | ||
|---|---|---|
Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticulation number larger than 40-50. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1186/1471-2105-15-127 | BMC Bioinformatics |
Keywords | Field | DocType |
Hybridization number, Phylogenetic networks, Approximation algorithms, Directed feedback vertex set | Reticulate,Approximation algorithm,Computational problem,Phylogenetic tree,Biology,Binary tree,Theoretical computer science,Software,Bioinformatics,Phylogenetics,Binary number | Journal |
Volume | Issue | ISSN |
15 | 1 | 1471-2105 |
Citations | PageRank | References |
5 | 0.54 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leo van Iersel | 1 | 215 | 24.58 |
| Steven Kelk | 2 | 193 | 25.60 |
| Nela Lekic | 3 | 24 | 4.19 |
| Celine Scornavacca | 4 | 216 | 18.80 |