An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study |
scientific article; zbMATH DE number 5144485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study |
scientific article; zbMATH DE number 5144485 |
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
0 references
0 references
0.8301909565925598
0 references
0.8301202654838562
0 references
0.8283534646034241
0 references
0.8279979825019836
0 references
0.7884235382080078
0 references
