"Computing phylogenetic roots with bounded degrees and errors is NP-complete."

Tatsuie Tsukiji, Zhi-Zhong Chen (2006)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2006.06.016

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/TsukijiC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/TsukijiC06
Tatsuie Tsukiji, Zhi-Zhong Chen:
Computing phylogenetic roots with bounded degrees and errors is NP-complete. Theor. Comput. Sci. 363(1): 43-59 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.