Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Brodal Gerth S"'
Publikováno v:
BMC Bioinformatics, Vol 7, Iss 1, p 29 (2006)
Abstract Background The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical Θ(n3) algorithm upon which all existing implementations are based.
Externí odkaz:
https://doaj.org/article/4990b600708a44df90d4d07ae961704d
Publikováno v:
Brodal, G S, Fagerberg, R, Pedersen, C N S, Eades, P (ed.) & Takaoka, T (ed.) 2001, Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n) . in Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 . 2223 of Lecture Notes in Computer Science edn, vol. 2223/2001, Springer, pp. 731-742, Christchurch, New Zealand, 19/12/2001 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::fe74e95f900f6e4d9c27e74fbf99b379
https://pure.au.dk/portal/da/publications/computing-the-quartet-distance-between-evolutionary-trees-in-time-on-log-n(0402da60-9825-11dc-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/computing-the-quartet-distance-between-evolutionary-trees-in-time-on-log-n(0402da60-9825-11dc-bee9-02004c4f4f50).html
Autor:
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., Jens Stoye, Maxime Crochemore, Leszek Gąsieniec
Publikováno v:
PUB-Publications at Bielefeld University
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6839c8ec47fa1f01816f40b0d63b8652
https://pub.uni-bielefeld.de/record/1918817
https://pub.uni-bielefeld.de/record/1918817
Autor:
Mailund T; Bioinformatics Research Center, University of Aarhus, Denmark. mailund@birc.dk, Brodal GS, Fagerberg R, Pedersen CN, Phillips D
Publikováno v:
BMC bioinformatics [BMC Bioinformatics] 2006 Jan 19; Vol. 7, pp. 29. Date of Electronic Publication: 2006 Jan 19.