An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study |
scientific article |
Statements
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (English)
0 references
18 April 2007
0 references
molecular evolution
0 references
phylogenetic networks
0 references
ancestral recombination graph
0 references
recombination
0 references
hybridization
0 references
SNP
0 references
