Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
Home
Publications
On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
Authors:
MB
Magnus Bordewich
Magnus Bordewich
CS
Charles Semple
Charles Semple
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 January 2005
journal article
research article
Published by
Springer Nature
in
Annals of Combinatorics
Vol. 8
(4)
,
409-423
DOI:
10.1007/s00026-004-0229-z
Abstract
No abstract available
Keywords
ROOTED PHYLOGENETIC TREE
ROOTED SUBTREE PRUNE AND REGRAFT
Cited
Cited by 297 articles
Scroll to top