Family-Joining: A Fast Distance-Based Method for Constructing Generally Labeled 
Trees

Kalaghatgi, Prabhav; Pfeifer, Nico; Lengauer, Thomas

doi:10.1093/molbev/msw123

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Family-Joining: A Fast Distance-Based Method for Constructing Generally Labeled Trees

MPS-Authors

/persons/resource/persons118128

Kalaghatgi, Prabhav
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;

/persons/resource/persons98170

Pfeifer, Nico
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44907

Lengauer, Thomas
Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society;

External Resource

http://mbe.oxfordjournals.org/content/33/10/2720/suppl/DC1
(付録資料)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

Mol Biol Evol-2016-Kalaghatgi-2720-34.pdf
(出版社版), 972KB

付随資料 (公開)

There is no public supplementary material available

引用

Kalaghatgi, P., Pfeifer, N., & Lengauer, T. (2016). Family-Joining: A Fast Distance-Based Method for Constructing Generally Labeled Trees. Molecular Biology and Evolution, 33(10), 2720-2734. doi:10.1093/molbev/msw123.

引用: https://hdl.handle.net/11858/00-001M-0000-002B-8268-E

要旨

要旨はありません