(Q46162423)

English

A short proof that phylogenetic tree reconstruction by maximum likelihood is hard

scientific article published in January 2006

In more languages

edit

Statements

instance of

scholarly article

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

title

A short proof that phylogenetic tree reconstruction by maximum likelihood is hard (English)

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

1 reference

1 reference

Sebastien Roch

1

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

publication date

1 January 2006

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

published in

IEEE/ACM Transactions on Computational Biology and Bioinformatics

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

volume

3

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

page(s)

92-94

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

issue

1

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

Identifiers

DOI

10.1109/TCBB.2006.4

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

PubMed ID

17048396

1 reference

stated in

Europe PubMed Central

20 December 2017

http://europepmc.org/abstract/MED/17048396

(Q46162423)

A short proof that phylogenetic tree reconstruction by maximum likelihood is hard

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)