发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

The computational complexity of inferring rooted phylogenies by parsimony

The computational complexity of inferring rooted phylogenies by parsimony

William H.E. Day; David S. Johnson; David Sankoff

作者William H.E. Day; David S. Johnson; David Sankoff
卷第81卷
期第1期
印刷ISSN0025-5564
文件大小629.55KB
发表时间1986
DOI10.1016/0025-5564(86)90161-6

← 返回【学霸图书馆】主页