Publication no #404   Type :   Html | Bib | Both
Created: 2007-11-17 01:16:40     Modified: 2014-08-19 20:24:44
404
photophoto
Magnus Bordewich and Charles Semple. On the computational complexity of the rooted subtree prune and regraft distance. In ACOM, Vol. 8:409-423, 2005.
Keywords: agreement forest, from rooted trees, NP complete, SPR distance.
Note: http://www.math.canterbury.ac.nz/~c.semple/papers/BS04.pdf.
       
Toggle abstract

@Article{BordewichSemple2005,
      AUTHOR = {Bordewich, Magnus and Semple, Charles},
      TITLE = {On the computational complexity of the rooted subtree prune and regraft distance},
      YEAR = {2005},
      JOURNAL = {ACOM},
      VOLUME = {8},
      PAGES = {409-423},
      URL = {http://dx.doi.org/10.1007/s00026-004-0229-z},
      NOTE = {http://www.math.canterbury.ac.nz/~c.semple/papers/BS04.pdf},
      ANNOTE = {BIBUPDATE : 20070919},
      KEYWORDS = {agreement forest, from rooted trees, NP complete, SPR distance}
}