Name
Abstract | ||
|---|---|---|
The use of genomic data sets for phylogenetics is complicated by the fact that evolutionary processes such as gene duplication and loss, or incomplete lineage sorting (deep coalescence) cause incongruence among gene trees. One well-known approach that deals with this complication is gene tree parsimony, which, given a collection of gene trees, seeks a species tree that requires the smallest number... |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TCBB.2013.103 | IEEE/ACM Transactions on Computational Biology and Bioinformatics |
Keywords | Field | DocType |
Vegetation,Search problems,Phylogeny,Bioinformatics,Algorithm design and analysis,Complexity theory,Genomics | Coalescent theory,Phylogenetic tree,Tree rearrangement,Computer science,Algorithm,Computational phylogenetics,Phylogenomics,Bioinformatics,Local search (optimization),Phylogenetics,Gene duplication | Journal |
Volume | Issue | ISSN |
10 | 4 | 1545-5963 |
Citations | PageRank | References |
6 | 0.51 | 32 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mukul S. Bansal | 1 | 294 | 23.97 |
| Oliver Eulenstein | 2 | 505 | 52.71 |