Building species trees from larger parts of phylogenomic databases (Q553332): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Celine Scornavacca / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92C40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C90 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92-08 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92D10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5932334 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
evolutionary tree | |||
Property / zbMATH Keywords: evolutionary tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graphs and graph transformation | |||
Property / zbMATH Keywords: graphs and graph transformation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
duplications | |||
Property / zbMATH Keywords: duplications / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial algorithms | |||
Property / zbMATH Keywords: polynomial algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intractability proof | |||
Property / zbMATH Keywords: intractability proof / rank | |||
Normal rank |
Revision as of 13:09, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Building species trees from larger parts of phylogenomic databases |
scientific article |
Statements
Building species trees from larger parts of phylogenomic databases (English)
0 references
27 July 2011
0 references
evolutionary tree
0 references
graphs and graph transformation
0 references
duplications
0 references
polynomial algorithms
0 references
intractability proof
0 references