SCOPUS 정보 검색 플랫폼

Volumn 94, Issue 5, 2005, Pages 225-230

A lower bound on the edge l∞ radius of Saitou and Nei's method for phylogenetic reconstruction

Author keywords

Analysis of algorithms; Evolutionary trees; Neighbor joining; Phylogenetic reconstruction

Indexed keywords

COMPUTATION THEORY; ERROR ANALYSIS; HEURISTIC PROGRAMMING; INTEGRATION; MATHEMATICAL MODELS; MATRIX ALGEBRA; TREES (MATHEMATICS);

ANALYSIS OF ALGORITHMS; EVOLUTIONARY TREES; NEIGHBOR-JOINING; PHYLOGENETIC RECONSTRUCTION;

EVOLUTIONARY ALGORITHMS;

EID: 18444413581 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/j.ipl.2005.02.006 Document Type: Article

Times cited : (2)

References (11)

1
- 0032256591
- On the approximability of numerical taxonomy (fitting distances by tree metrics)
- R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup On the approximability of numerical taxonomy (fitting distances by tree metrics) SIAM J. Comput. 28 3 1999 1073 1085
- (1999) SIAM J. Comput. , vol.28 , Issue.3 , pp. 1073-1085
- Agarwala, R.¹ Bafna, V.² Farach, M.³ Paterson, M.⁴ Thorup, M.⁵

2
- 0001656793
- The performance of neighbor-joining methods of phylogenetic reconstruction
- K. Atteson The performance of neighbor-joining methods of phylogenetic reconstruction Algorithmica 25 1999 251 278
- (1999) Algorithmica , vol.25 , pp. 251-278
- Atteson, K.¹

3
- 0010795630
- Paris
- R. Baire, Leçons sur les Fonctions Discontinues, Paris, 1905
- (1905) Leçons sur les Fonctions Discontinues
- Baire, R.¹

4
- 0004026685
- Wiley New York
- J.-P. Barthélemy, and A. Guénoche Trees and Proximity Representations 1991 Wiley New York
- (1991) Trees and Proximity Representations
- Barthélemy, J.-P.¹ Guénoche, A.²

5
- 0003904891
- Springer Berlin
- B. Bollobás Modern Graph Theory 1998 Springer Berlin
- (1998) Modern Graph Theory
- Bollobás, B.¹

6
- 0023079987
- Computational complexity of inferring phylogenies from dissimilarity matrices
- W.H.E. Day Computational complexity of inferring phylogenies from dissimilarity matrices Bull. Math. Biol. 49 4 1987 461 467
- (1987) Bull. Math. Biol. , vol.49 , Issue.4 , pp. 461-467
- Day, W.H.E.¹

7
- 0036568578
- High-performance algorithm engineering for computational phylogenetics
- B. Moret, D. Bader, and T. Warnow High-performance algorithm engineering for computational phylogenetics J. Supercomputing 22 1 2002 99 111
- (2002) J. Supercomputing , vol.22 , Issue.1 , pp. 99-111
- Moret, B.¹ Bader, D.² Warnow, T.³

8
- 0023375195
- The neighbor-joining method: A new method for reconstructing phylogenetic trees
- N. Saitou, and M. Nei The neighbor-joining method: a new method for reconstructing phylogenetic trees Mol. Biol. Evol. 4 1987 406 425
- (1987) Mol. Biol. Evol. , vol.4 , pp. 406-425
- Saitou, N.¹ Nei, M.²

10
- 0004069901
- W.H. Freeman San Francisco, CA
- P. Sneath, and R. Sokal Numerical Taxonomy 1973 W.H. Freeman San Francisco, CA
- (1973) Numerical Taxonomy
- Sneath, P.¹ Sokal, R.²

11
- 0000491446
- Additive similarity trees
- S. Sattath, and A. Tversky Additive similarity trees Psychometrika 42 3 1977 319 345
- (1977) Psychometrika , vol.42 , Issue.3 , pp. 319-345
- Sattath, S.¹ Tversky, A.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.