On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model

Location
Deutsche Nationalbibliothek Frankfurt am Main
ISSN
1748-7188
Extent
Online-Ressource
Language
Englisch
Notes
online resource.

Bibliographic citation
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model ; volume:12 ; number:1 ; day:14 ; month:3 ; year:2017 ; pages:1-12 ; date:12.2017
Algorithms for molecular biology ; 12, Heft 1 (14.3.2017), 1-12, 12.2017

Classification
Biowissenschaften, Biologie

Creator
Bork, Daniel
Contributor
Cheng, Ricson
Wang, Jincheng
Sung, Jean
Libeskind-Hadas, Ran
SpringerLink (Online service)

DOI
10.1186/s13015-017-0098-8
URN
urn:nbn:de:1111-201704031581
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 10:55 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Bork, Daniel
  • Cheng, Ricson
  • Wang, Jincheng
  • Sung, Jean
  • Libeskind-Hadas, Ran
  • SpringerLink (Online service)

Other Objects (12)